Distributed bisimulations
- 1 October 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 36 (4) , 887-911
- https://doi.org/10.1145/76359.76369
Abstract
A new equivalence between concurrent processes is proposed. It generalizes the well-known bisimulation equivalence to take into account the distributed nature of processes. The result is a noninterleaving semantic theory; concurrent processes are differentiated from processes that are non-deterministic but sequential. The new equivalence, together with its observational version, is investigated for a subset of the language CCS, and various algebraic characterizations are obtained.Keywords
This publication has 12 references indexed in Scilit:
- Concurrency and atomicityTheoretical Computer Science, 1988
- Petri net models for algebraic theories of concurrencyPublished by Springer Nature ,1987
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Partial ordering derivations for CCSPublished by Springer Nature ,1985
- Algèbre de processus et synchronisationTheoretical Computer Science, 1984
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- Testing equivalences for processesTheoretical Computer Science, 1984
- Flowgraphs and Flow AlgebrasJournal of the ACM, 1979