CCS expressions, finite state processes, and three problems of equivalence
- 1 May 1990
- journal article
- Published by Elsevier BV in Information and Computation
- Vol. 86 (1), 43-68
- https://doi.org/10.1016/0890-5401(90)90025-d
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the analysis of cooperation and antagonism in networks of communicating processesAlgorithmica, 1988
- Bisimulation of automataInformation and Computation, 1988
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Acceptance treesJournal of the ACM, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Testing equivalences for processesTheoretical Computer Science, 1984
- A complete inference system for a class of regular behavioursJournal of Computer and System Sciences, 1984
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966