Distributed bisimulations

DOI10.1145/76359.76369zbMath0697.68076OpenAlexW2293557922MaRDI QIDQ3474903

Ilaria Castellani, Matthew C. B. Hennessy

Publication date: 1989

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00075679/file/RR-0875.pdf

zbMATH Keywords

concurrent processesobservational equivalencesemantics of programming languagesnoninterleaving semantic theory

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)

Related Items

A theory of processes with localities, A static view of localities, Comparing locality and causality based equivalences, Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines, Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Architectural CCS, Concurrency and atomicity, Timing and causality in process algebra, Verification of finite-state machines: a distributed approach, Unique parallel decomposition in branching and weak bisimulation semantics, On relating concurrency and nondeterminism, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, A partial ordering semantics for CCS, Distribution and locality of concurrent systems, Team bisimilarity, and its associated modal logic, for BPP nets, Location equivalence in a parametric setting, Observational structures and their logic, Observing localities, A parametric approach to localities, New Bisimulation Semantics for Distributed Systems, A study on team bisimulation and H-team bisimulation for BPP nets, Basic observables for processes