A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Ready-trace semantics for concrete process algebra with the priority operator
The Computer Journal
Bisimulation through probabilistic testing
Information and Computation
Probabilistic communicating processes
Theoretical Computer Science
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Sound and Complete Proof System for Probabilistic Processes
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Expressive Power of Schedulers in Distributed Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative model checking revisited: neither decidable nor approximable
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Making random choices invisible to the scheduler
Information and Computation
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
Extending Communicating Sequential Processes (CSP) by preserving the distributivity laws for internal choice, in the presence of probabilistic choice, has been an open problem so far. The problem stems from a well known disagreement between probabilistic choice and nondeterministic choice, that raises congruence issues for parallel composition. Recently, it has been argued that the congruence issue can be resolved only by restricting the power of the schedulers that resolve the nondeterminism. In our previous work, we have restricted the schedulers by suitably labeling the nondeterministic transitions. We have defined a ready-trace equivalence and a parallel composition with hiding for which the equivalence is a congruence. In this paper, we generalize our model and give a CSP-style axiomatic characterization of the ready-trace equivalence. From the axiomatization it follows that all distributivity axioms for internal choice from CSP are preserved, and no new axioms are added.