Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences

DOI10.1016/j.entcs.2008.04.059zbMath1286.68350OpenAlexW1969246386MaRDI QIDQ5415615

Carlos Gregorio Rodríguez, David de Frutos-Escrig, Miguel Palomino

Publication date: 13 May 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.2008.04.059

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 ⋮ Ready to preorder: the case of weak process semantics ⋮ (Bi)simulations up-to characterise process semantics

Cites Work

• Unnamed Item
• Nested semantics over finite trees are equationally hard
• Ready to preorder: an algebraic and general proof
• (Bi)simulations up-to characterise process semantics
• Impossible futures and determinism
• Simulations Up-to and Canonical Preorders
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Bisimulation can't be traced
• CONCUR 2005 – Concurrency Theory
• Processes, Terms and Cycles: Steps on the Road to Infinity