Bisimulation through probabilistic testing
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Journal of the ACM (JACM)
A compositional approach to performance modelling
A compositional approach to performance modelling
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Structural operational semantics for stochastic process calculi
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Exploiting Labels in Structural Operational Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Quantitative Kleene coalgebras
Information and Computation
The microcosm principle and compositionality of GSOS-based component calculi
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Structural operational semantics for stochastic and weighted transition systems
Information and Computation
A uniform definition of stochastic process calculi
ACM Computing Surveys (CSUR)
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A general rule format for the SOS specification of weighted systems is obtained via the coalgebraic approach of Turi and Plotkin. Previously known formats for labelled transition systems (GSOS) and stochastic systems (SGSOS) appear as special cases.