Independence of the equational axioms for iteration theories
Journal of Computer and System Sciences
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Complete systems of B -rational identities
Theoretical Computer Science
Aspects of probabilistic process algebra
Aspects of probabilistic process algebra
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Completeness of Park induction
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
The equational logic of fixed points
Theoretical Computer Science
Information and Computation
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
Introduction to Process Algebra
Introduction to Process Algebra
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Labelled Markov Processes as Generalised Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Quantitative Kleene coalgebras
Information and Computation
A Connection Between Concurrency and Language Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571-595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize, among others, the equational properties of the fixed point operator on (驴-)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity. Hence probabilistic bisimilarity (over finite-state agents) has an equational axiomatization relative to iteration algebras.