Universal axioms for bisimulations

DOI10.1016/0304-3975(93)90153-KzbMath0782.68044OpenAlexW2074117888WikidataQ114683720 ScholiaQ114683720MaRDI QIDQ685411

Pierpaolo Degano, Rocco De Nicola, Ugo Montanari

Publication date: 25 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90153-k

zbMATH Keywords

bisimulationsconcurrency models

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (14)

A static view of localities ⋮ Automatizing parametric reasoning on distributed concurrent systems ⋮ Interactive foundations of computing ⋮ Read-write causality ⋮ Ugo Montanari and Concurrency Theory ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Extended transition systems for parametric bisimulation ⋮ Locality and interleaving semantics in calculi for mobile processes ⋮ Location equivalence in a parametric setting ⋮ Automatic verification of distributed systems: the process algebra approach. ⋮ A parametric approach to localities ⋮ Proved trees ⋮ Pierpaolo Degano ⋮ Towards a unified view of bisimulation: A comparative study

Cites Work

• Equational type logic
• Algèbre de processus et synchronisation
• A partial ordering semantics for CCS
• Calculi for synchrony and asynchrony
• Algebra of communicating processes with abstraction
• Concurrent histories: a basis for observing distributed systems
• Bisimulations and abstraction homomorphisms
• Modeling concurrency with partial orders
• Characterizing finite Kripke structures in propositional temporal logic
• Concurrency and atomicity
• A calculus of communicating systems
• Testing equivalences for processes
• A structural approach to operational semantics
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Three logics for branching bisimulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal axioms for bisimulations