Simulations Up-to and Canonical Preorders

DOI10.1016/j.entcs.2007.08.014zbMath1278.68148OpenAlexW2005848350MaRDI QIDQ2871827

David de Frutos-Escrig, Carlos Gregorio Rodríguez

Publication date: 10 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.08.014

zbMATH Keywords

processeslinear time-branching time spectrumsemantic preorderssimulations up-to

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Ready to preorder: an algebraic and general proof, Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences, On the Unification of Process Semantics: Equational Semantics, (Bi)simulations up-to characterise process semantics

Cites Work

• Simulations in coalgebra
• Extensional equivalences for transition systems
• Bisimulation through probabilistic testing
• A structural approach to operational semantics
• Testing equivalence as a bisimulation equivalence
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• New Bisimulation Semantics for Distributed Systems
• On the bisimulation proof method
• Bisimulation can't be traced
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Foundations of Software Science and Computational Structures
• Generic Forward and Backward Simulations
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item