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
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
On the Relationship of CCS and CSP
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
A Basic Parallel Process as a Parallel Pushdown Automaton
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
| Hi-index | 0.00 |
We consider a generic process algebra of which the standard process algebras ACP, CCS and CSP are subalgebras of reduced expressions. In particular such an algebra is endowed with a recursion operator which computes minimal fixpoint solutions of systems of equations over processes. As model for processes we consider finite-state transition systems modulo Milner's observational congruence and we define an operational semantics for the process algebra. Over such a generic algebra we show the following. We provide a syntactical characterization (allowing as many terms as possible) for the equations involved in recursion operators, which guarantees that transition systems generated by the operational semantics are indeed finite-state. Vice-versa we show that every process admits a specification in terms of such a restricted form of recursion. We then present an axiomatization which is ground-complete over such a restricted signature: an equation can be derived from the axioms between closed terms exactly when the corresponding finite-state transition systems are observationally congruent. Notably, in presenting such an axiomatization, we also show that the two standard axioms of Milner for weakly unguarded recursion can be expressed by using just a single axiom.