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
Communication and concurrency
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A complete axiom system for finite-state probabilistic processes
Proof, language, and interaction
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
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
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A Prover for the muCRL toolset with applications -- version 0.1
A Prover for the muCRL toolset with applications -- version 0.1
Theoretical Computer Science
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
Timed, distributed, probabilistic, typed processes
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Value-passing CCS with noisy channels
Theoretical Computer Science
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
On the semantics of Markov automata
Information and Computation
| Hi-index | 5.23 |
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 recursion 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.