# Axiomatizing Probabilistic Processes: ACP with Generative Probabilities

@article{Baeten1995AxiomatizingPP, title={Axiomatizing Probabilistic Processes: ACP with Generative Probabilities}, author={J. Baeten and J. Bergstra and S. Smolka}, journal={Inf. Comput.}, year={1995}, volume={121}, pages={234-255} }

This paper is concerned with finding complete axiomatizations of probabilistic processes. We examine this problem within the context of the process algebra ACP and obtain as our end-result the axiom system prACP I −- , a probabilistic version of ACP which can be used to reason algebraically about the reliability and performance of concurrent systems. Our goal was to introduce probability into ACP in as simple a fashion as possible. Optimally, ACP should be the homomorphic image of the… Expand

#### Topics from this paper

#### 219 Citations

Algebraic theory of probabilistic processes

- Computer Science, Mathematics
- J. Log. Algebraic Methods Program.
- 2003

This paper represents a complete study of the adaptation of the classical testing theory for probabilistic processes with adequate extensions of acceptance sets and acceptance trees and a sound and complete axiomatization of the testing equivalence. Expand

Process Algebra with Probabilistic Choice

- Computer Science
- ARTS
- 1999

This paper treats the problem of combining parallel composition with probability and with or without non-determinism in the setting of process algebra in the form of ACP to obtain the Basic Process Algebra with probabilistic choice prBPA and the axiom system for ACP+π. Expand

Axiomatizations for Probabilistic Bisimulation

- Computer Science
- ICALP
- 2001

Complete axiomatizations for different notions of probabilistic bisimulation on a recursion free process algebra with probability and nondeterminism under alternating and non-alternating semantics reveal the implications of the different choices. Expand

Process algebra with interleaving probabilistic parallel composition

- Mathematics, Economics
- 1999

In this paper we present a probabilistic version of the axiom system A CP appropriate for the (algebraic) formal description of pIobabilisti.c processes. The proposed formalism is built in a modular… Expand

Probabilistic Congruence for Semistochastic Generative Processes

- Computer Science
- FoSSaCS
- 2005

Most of operations of the probabilistic process algebras studied in the literature are captured by the rule format, which, therefore, has practical applications. Expand

An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice

- Computer Science
- From Software Engineering to Formal Methods and Tools, and Back
- 2019

Distributions rather than states are the leading ingredients for building the semantics and the accompanying equational theory, for which soundness and completeness are established. Expand

Axioms for Probability and Nondeterminism

- Computer Science, Mathematics
- EXPRESS
- 2003

A full abstraction result is proved that shows two processes have the same denotation if and only if they are probabilistically bisimilar. Expand

Taking Chances on k and fail : Extending Strong and Probabilistic

- 1999

For a process language, featuring nondeterministic and probabilistic choice, a parallel operator and a failure construct, a notion of bisimulation is proposed. As one can interpret recovery from… Expand

Probabilistic Information Flow in a Process Algebra

- Computer Science
- CONCUR
- 2001

A process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems and a notion of probabilism bisimulation in order to define classical security properties, such as nondeterministic noninterference (NNI) and nondeducibility on compositions (NDC), in the probablistic setting. Expand

Axiomatizations for Probabilistic Finite-State Behaviors

- Computer Science
- FoSSaCS
- 2005

This is the first work, to the authors' knowledge, that provides a complete axiomatization for weak equivalences in the presence of recursion and both nondeterministic and probabilistic choice. Expand

#### References

SHOWING 1-10 OF 19 REFERENCES

Algebraic Reasoning for Probabilistic Concurrent Systems

- Computer Science
- Programming Concepts and Methods
- 1990

The nondeterministic process summation operator of SCCS is replaced with a probabilistic one, in which the probability of behaving like a particular summand is given explicitly, to obtain a calculus, PCCS, for reasoning about communicating Probabilistic processes. Expand

A Remark on Bisimulation Between Probabilistic Processes

- Mathematics, Computer Science
- Logic at Botik
- 1989

This paper exhibits a pair of computable, bisimilar systems which are experimentally distinguishable for any computable weighting of their transitions. Expand

Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes

- Mathematics, Computer Science
- CONCUR
- 1990

It is shown that, unlike nondeterministic transition systems, “maximality” of traces and failures does not increase the distinguishing power of trace and failure equivalence, respectively. Expand

Compositional Verification of Probabilistic Processes

- Computer Science
- CONCUR
- 1992

This study identifies a new probabilistic logic, which is needed in order to support decomposition, and offers complete axiomatizations for both the calculus and the logic. Expand

Reactive, Generative and Stratified Models of Probabilistic Processes

- Mathematics, Computer Science
- Inf. Comput.
- 1995

Three models of probabilistic processes, namely, reactive, generative, and stratified, are investigated within the context of PCCS, an extension of Milner′s SCCS in which each summand of a process summation expression is guarded by a probability and the sum of these probabilities is 1. Expand

Bisimulation through Probabilistic Testing

- Computer Science, Mathematics
- Inf. Comput.
- 1991

By using probabilistic transition systems as the underlying semantic model, it is shown how a testing algorithm can distinguish, with a probability arbitrarily close to one, between processes that are not bisimulation equivalent. Expand

A Synchronous Calculus of Relative Frequency

- Mathematics, Computer Science
- CONCUR
- 1990

A weighted synchronous calculus is presented that can be interpreted as reasoning over probabilistic processes and the notion of dominance is added, shown to be dual to that of “zero probability” and used to construct arbitrary priority structures. Expand

A Calculus of Communicating Systems

- Mathematics, Computer Science
- Lecture Notes in Computer Science
- 1980

A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0. Expand

Specification and refinement of probabilistic processes

- Computer Science, Mathematics
- [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
- 1991

A formalism for specifying probabilistic transition systems, which constitute a basic semantic model for description and analysis of reliability aspects of concurrent and distributed systems, is presented and it is shown that it is analogous to the extension from processes to modal transition systems. Expand

Foundations of Compositional Program Refinement - Safety Properties

- Computer Science
- REX Workshop
- 1989

This paper develops a foundation for refinement of parallel programs that may synchronously communicate and/or share variables; programs rendered as 1st order transition systems and shows that they yield assertional methods for refinement that resemble the methods used in Z. Manna and A. Pnueli's temporal logic proof system. Expand