Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Process algebra
Bisimulation through probabilistic testing
Information and Computation
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
Communication and Concurrency
ACM Transactions on Computational Logic (TOCL)
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
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
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
A ground-complete axiomatization of finite state processes in process algebra
CONCUR 2005 - Concurrency Theory
Axiomatizations for probabilistic finite-state behaviors
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
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
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
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Compositional methods for information-hiding
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Making random choices invisible to the scheduler
Information and Computation
Quantitative Kleene coalgebras
Information and Computation
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Bisimulation for Quantum Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch's simple probabilistic automata. We consider strong bisimulation and observational equivalence, and provide complete axiomatizations for a language that includes parallel composition and (guarded) recursion. The presence of the parallel composition introduces various technical difficulties and some restrictions are necessary in order to achieve complete axiomatizations.