A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
Communication and Concurrency
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Quantitative Kleene coalgebras
Information and Computation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
| Hi-index | 0.00 |
We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch's probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguarded recursion the “natural” weak equivalences are undecidable. This is the first work, to our knowledge, that provides a complete axiomatization for weak equivalences in the presence of recursion and both nondeterministic and probabilistic choice.