Ready to Preorder: Get Your BCCSP Axiomatization for Free!

DOI10.1007/978-3-540-73859-6_5MaRDI QIDQ3612484zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Anna Ingolfsdottir, Wan Fokkink

Publication date 10 March 2009

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73859-6_5

Mathematics Subject Classification ID

Equational classes, universal algebra in model theory (03C05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Ready to preorder: the case of weak process semantics
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Axiomatizing weak simulation semantics over BCCSP
• scientific article; zbMATH DE number 2038703
• The equational theory of weak complete simulation semantics over BCCSP

Cited in

(13)

• Axiomatizing weak ready simulation semantics over BCCSP
• Lifting non-finite axiomatizability results to extensions of process algebras
• Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
• On the unification of process semantics: equational semantics
• On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
• (Bi)simulations up-to characterise process semantics
• Ready to preorder: an algebraic and general proof
• scientific article; zbMATH DE number 2038703 (Why is no real title available?)
• Simulations up-to and canonical preorders (extended abstract)
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Ready to preorder: the case of weak process semantics
• On finite alphabets and infinite bases
• Axiomatizing weak simulation semantics over BCCSP

This page was built for publication: Ready to Preorder: Get Your BCCSP Axiomatization for Free!

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612484)