On the Unification of Process Semantics: Equational Semantics

DOI10.1016/j.entcs.2009.07.093zbMath1337.68180OpenAlexW2077666692MaRDI QIDQ2805160

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

Publication date: 10 May 2016

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.2009.07.093

zbMATH Keywords

processesequational semanticslinear time-branching time spectrumuniform presentation

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 (6)

The Equational Theory of Weak Complete Simulation Semantics over BCCSP ⋮ Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ The quantitative linear-time-branching-time spectrum ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ On the Unification of Process Semantics: Observational Semantics ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Ready to preorder: an algebraic and general proof
• Revivals, stuckness and the hierarchy of CSP models
• Impossible futures and determinism
• Responsiveness and stable revivals
• Simulations Up-to and Canonical Preorders
• On the Unification of Process Semantics: Observational Semantics
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Computer Aided Verification
• CONCUR 2005 – Concurrency Theory
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: On the Unification of Process Semantics: Equational Semantics