Global renaming operators in concrete process algebra
Information and Computation
Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process algebra
Handbook of logic in computer science (vol. 4)
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
A general conservative extension theorem in process algebras with inequalities
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Process Algebra with Partial Choice
CONCUR '94 Proceedings of the Concurrency Theory
A General Conservative Extension Theorem in Process Algebra
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Relations among quantum processes: bisimilarity and congruence
Mathematical Structures in Computer Science
Decision problems for interval Markov chains
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Probabilistic i/o automata: theories of two equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
New results for Constraint Markov Chains
Performance Evaluation
Stochastic Petri Box Calculus with Discrete Time
Fundamenta Informaticae
| Hi-index | 0.01 |
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this problem in the setting of process algebra in the form of ACP. First, probabilities are introduced by an operator for the internal probabilistic choice. In this way we obtain the Basic Process Algebra with probabilistic choice prBPA. Afterwards, prBPA is extended with parallel composition to ACP+π. We give the axiom system for ACP+π and a complete operational semantics that preserves the interleaving model for the dynamic concurrent processes. Considering the PAR protocol, a communication protocol that can be used in the case of unreliable channels, we investigate the applicability of ACP+π. Using in addition only the priority operator and the preabstraction operator we obtain a recursive specifications of the behaviour of the protocol that can be viewed as a Markov chain.