A calculus for generic, QoS-aware component composition
From MaRDI portal
Publication:1949090
DOI10.1007/s11786-012-0137-2zbMath1263.68042OpenAlexW2060624144MaRDI QIDQ1949090
Publication date: 25 April 2013
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/21234
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulations in coalgebra
- Components as coalgebras: the refinement dimension
- Transposing partial components--an exercise on coalgebraic refinement
- Universal coalgebra: A theory of systems
- Strong functors and monoidal monads
- Pre-Galois Connection on Coalgebras for Generic Component Refinement
- Coalgebraic Components in a Many-Sorted Microcosm
- QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
- Generic Forward and Backward Simulations II: Probabilistic Simulation
- Queueing Networks and Markov Chains
This page was built for publication: A calculus for generic, QoS-aware component composition