A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
Bounded nondeterminism and the approximation induction principle in process algebra
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Merge and termination in process algebra
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Process algebra
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Notes on the methodology of CCS and CSP
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Process algebra with propositional signals
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Communication and Concurrency
ACM Transactions on Computational Logic (TOCL)
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
A ground-complete axiomatization of finite state processes in process algebra
CONCUR 2005 - Concurrency Theory
Hi-index | 0.00 |
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operators, but also to the terminology and ‘way of thinking’ of the community that has been (and still is) working with them. In this paper we will first discuss these differences and try to clarify the different usage of terminology and concepts. Then, as a result of this discussion, we define a generic process algebra where each of the basic mechanisms of the three process algebras (including minimal fixpoint based unguarded recursion) is expressed by an operator, and which can be used as an underlying common language. We show an example of the advantages of adopting such a language instead of one of the three more specialised algebras: producing a complete axiomatisation for Milner's observational congruence in the presence of (unguarded) recursion and static operators. More precisely, we provide a syntactical characterisation (allowing as many terms as possible) for the equations involved in recursion operators, which guarantees that transition systems generated by the operational semantics are finite state. Conversely, we show that every process admits a specification in terms of such a restricted form of recursion. We then present an axiomatisation that is ground complete over such a restricted signature. Notably, we also show that the two standard axioms of Milner for weakly unguarded recursion can be expressed using a single axiom only.