Communicating sequential processes
Communicating sequential processes
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
Computer networks (3rd ed.)
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
An Asynchronous Calculus for Generative-Reactive Probabilistic Systems
An Asynchronous Calculus for Generative-Reactive Probabilistic Systems
Theory and Application of Extended Markovian Process Algebra (PhD Thesis)
Theory and Application of Extended Markovian Process Algebra (PhD Thesis)
| Hi-index | 0.00 |
We consider a discrete time process algebra capable of (i) modeling processes with different probabilistic advancing speeds (mean number of actions executed per time unit), and (ii) expressing probabilistic external/internal choices and multiway synchronization. We show that, when evaluating steady state based performance measures expressed by associating rewards with actions, such a probabilistic approach provides an exact solution even if advancing speeds are considered not to be probabilistic (i.e. actions of different processes have a different exact duration), without incurring in the state space explosion problem which arises with an intuitive application of a standard synchronous approach. We then present a case study on multi-path routing showing the expressiveness of our calculus and that it makes it particularly easy to produce scalable specifications.