An algebraic characterization of observational equivalence

DOI10.1016/0304-3975(95)00141-7zbMath0871.68130OpenAlexW2070847316MaRDI QIDQ1351804

André Arnold, Ilaria Castellani

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00141-7

zbMATH Keywords

Hennessy-Milner logictransition system equivalences

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Observability (93B07) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (1)

Algebraic characterizations of trace and decorated trace equivalences over tree-like structures

Cites Work

• Bisimulations and abstraction homomorphisms
• A distributed operational semantics of CCS based on condition/event systems
• Bisimulation is two-way simulation
• Bisimulation of automata
• An algebraic characterization of transition system equivalences
• The power of the future perfect in program logics
• Algebraic laws for nondeterminism and concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algebraic characterization of observational equivalence