An algebraic characterization of transition system equivalences

DOI10.1016/0890-5401(89)90054-0zbMath0679.68116OpenAlexW2063896982MaRDI QIDQ1822989

Anne Dicky, André Arnold

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90054-0

zbMATH Keywords

power algebraslogical equivalencealgebraic interpretation of temporal logicsaturating quasi-homomorphisms

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Verification and comparison of transition systems ⋮ Bisimulation is two-way simulation ⋮ An algebraic characterization of observational equivalence ⋮ Fairness and regularity for SCCS processes ⋮ Confluence for process verification ⋮ Studying equivalences of transition systems with algebraic tools ⋮ Observational structures and their logic ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• A logical characterization of observation equivalence
• A proof-theoretic characterization of observational equivalence
• Bisimulations and abstraction homomorphisms
• An algebraic and algorithmic method for analysing transition systems
• Algebraic laws for nondeterminism and concurrency

This page was built for publication: An algebraic characterization of transition system equivalences