A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Specification-oriented semantics for communicating processes
Acta Informatica
Theoretical Computer Science
Ready-trace semantics for concrete process algebra with the priority operator
The Computer Journal
Process simulation and refinement
Formal Aspects of Computing
Process algebra
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Acceptance Automata: A Framework for Specifying and Verifying TCSP Parallel Systems
PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Testing Equivalence as a Bisimulation Equivalence
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
| Hi-index | 0.00 |
We introduce a new way of describing a subclass of CSP processes in the failures-divergence model. These processes will be called rational, by analogy with rational languages in formal language theory. Usually, rational languages are characterized as a solution of a linear system of equations. In this work we use a restricted set of CSP operators and recursion to define CSP-linear systems. We show that these systems are in many respects similar to linear systems in formal language theory. Our main result states that for linear systems the least fix point solution in a CPO can be obtained using Arden's lemma. Furthermore we give an alternative definition of the class of rational processes in terms of automata. Finally we analyze how the previous result can be extended to other semantic models.