Location equivalence in a parametric setting

DOI10.1016/0304-3975(94)00219-9zbMath0874.68122OpenAlexW2021202226MaRDI QIDQ672708

Daniel Yankelevich, Ugo Montanari

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00219-9

zbMATH Keywords

forestlocation equivalence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Proved trees ⋮ A process algebra with distributed priorities ⋮ Tile formats for located and mobile systems. ⋮ Dynamic connectors for concurrency

Cites Work

• Universal axioms for bisimulations
• Observing localities
• Equational type logic
• A theory of processes with localities
• A static view of localities
• Comparing locality and causality based equivalences
• A structural approach to operational semantics
• Distributed bisimulations
• An algebraic view of interleaving and distributed operational semantics for CCS
• A parametric approach to localities
• Proved trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Location equivalence in a parametric setting