Ready to preorder: the case of weak process semantics

DOI10.1016/j.ipl.2008.09.003zbMath1191.68434OpenAlexW2038305454MaRDI QIDQ975539

Taolue Chen, W. J. Fokkink, Robert J. van Glabbeek

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://unsworks.unsw.edu.au/fapi/datastream/unsworks:7777/SOURCE01?view=true

zbMATH Keywords

process algebraconcurrencyweak process semantics

Mathematics Subject Classification ID

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, Axiomatizing weak simulation semantics over BCCSP, Lifting non-finite axiomatizability results to extensions of process algebras, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures, Axiomatizing Weak Ready Simulation Semantics over BCCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ready to preorder: an algebraic and general proof
• On finite alphabets and infinite bases
• (Bi)simulations up-to characterise process semantics
• Testing equivalences for processes
• Notes on the methodology of CCS and CSP
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• A Theory of Communicating Sequential Processes
• Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
• Processes, Terms and Cycles: Steps on the Road to Infinity