Ready to Preorder: Get Your BCCSP Axiomatization for Free!

DOI10.1007/978-3-540-73859-6_5zbMath1214.68239OpenAlexW2147877669MaRDI QIDQ3612484

Luca Aceto, Anna Ingólfsdóttir, W. J. 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

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

Related Items (11)

Ready to preorder: an algebraic and general proof ⋮ On finite alphabets and infinite bases ⋮ 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 ⋮ Simulations Up-to and Canonical Preorders

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