Bisimulations and abstraction homomorphisms

DOI10.1016/0022-0000(87)90025-0zbMath0619.68021OpenAlexW2076184535MaRDI QIDQ1089791

Ilaria Castellani

Publication date: 1987

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90025-0

zbMATH Keywords

bisimulationabstraction homomorphismslabelled transition systemsChurch-Rosser propertynondeterministic processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (9)

Bisimulation is two-way simulation ⋮ An algebraic characterization of observational equivalence ⋮ Concurrency and atomicity ⋮ On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Observational structures and their logic ⋮ Universal axioms for bisimulations ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures ⋮ An algebraic characterization of transition system equivalences

Cites Work

• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisimulations and abstraction homomorphisms