Ready to preorder: an algebraic and general proof

DOI10.1016/j.jlap.2008.09.001zbMath1187.68309OpenAlexW1967381334MaRDI QIDQ843212

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

Publication date: 29 September 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2008.09.001

zbMATH Keywords

process algebraaxiomatizationsemantic equivalencelinear-time branching-time spectrumsemantic preorder

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (8)

Axiomatizing weak simulation semantics over BCCSP ⋮ Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Ready to preorder: the case of weak process semantics ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures ⋮ On the Unification of Process Semantics: Equational Semantics ⋮ (Bi)simulations up-to characterise process semantics ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested semantics over finite trees are equationally hard
• Ready to preorder: the case of weak process semantics
• Bisimulation through probabilistic testing
• A domain equation for bisimulation
• Simulations Up-to and Canonical Preorders
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Bisimulation can't be traced
• Foundations of Software Science and Computation Structures
• Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
• Automata, Languages and Programming
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Ready to preorder: an algebraic and general proof