A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Journal of the ACM (JACM)
Enhanced operational semantics
ACM Computing Surveys (CSUR)
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
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
Process algebra for performance evaluation
Theoretical Computer Science
Information Processing Letters
Language-based performance prediction for distributed and mobile systems
Information and Computation
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Process Algebras for Quantitative Analysis
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Rate-Based Transition Systems for Stochastic Process Calculi
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
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
Structural operational semantics for weighted transition systems
Semantics and algebraic specification
The Measurable Space of Stochastic Processes
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
| Hi-index | 0.00 |
We introduce weighted GSOS, a general syntactic framework to specify well-behaved transition systems where transitions are equipped with weights coming from a commutative monoid. We prove that weighted bisimilarity is a congruence on systems defined by weighted GSOS specifications. We illustrate the flexibility of the framework by instantiating it to handle some special cases, most notably that of stochastic transition systems. Through examples we provide weighted-GSOS definitions for common stochastic operators in the literature.