Distributed bisimulations

Authors:
Ilaria Castellani;Matthew Hennessy
Affiliations:
INRIA Sophia-Antipolis, Valbonne, France;Univ. of Sussex, Brighton, UK
Venue:
Journal of the ACM (JACM)
Year:
1989

Citing 13
Cited 13

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
Modeling concurrency with partial orders

International Journal of Parallel Programming
Petri net models for algebraic theories of concurrency

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
The step failure semantics

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Concurrency and atomicity

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Flowgraphs and Flow Algebras

Journal of the ACM (JACM)
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Event Structure Semantics for CCS and Related Languages

Proceedings of the 9th Colloquium on Automata, Languages and Programming
On the Relationship of CCS and Petri Nets

Proceedings of the 11th Colloquium on Automata, Languages and Programming
Partial ordering derivations for CCS

FCT '85 Fundamentals of Computation Theory
A Term Model for CCS

MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science

A formalism for real-time concurrent object-oriented computing

OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
A Timed Calculus for Distributed Objects with Clocks

ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
An omega-Complete Equational Specification of Interleaving

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Mobile Processes: A Commented Bibliography

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Mobile processes: a commented bibliography

Modeling and verification of parallel processes
Structured transition systems with parametric observations: observational congruences and minimal realizations

Mathematical Structures in Computer Science
A Relation-Algebraic Theory of Bisimulations

Fundamenta Informaticae
New Bisimulation Semantics for Distributed Systems

FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra

Concurrency, Graphs and Models
Bisimulations for a distributed higher order π-calculus

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
A Relation-Algebraic Theory of Bisimulations

Fundamenta Informaticae
On the Decidability of Non-Interleaving Process Equivalences

Fundamenta Informaticae
Unique parallel decomposition in branching and weak bisimulation semantics

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.