Ready to Preorder: Get Your BCCSP Axiomatization for Free!
From MaRDI portal
Publication:3612484
DOI10.1007/978-3-540-73859-6_5zbMath1214.68239MaRDI 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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03C05: Equational classes, universal algebra in model theory
Related Items
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences, Ready to preorder: an algebraic and general proof, On finite alphabets and infinite bases, Lifting non-finite axiomatizability results to extensions of process algebras, Ready to preorder: the case of weak process semantics, (Bi)simulations up-to characterise process semantics, Axiomatizing weak simulation semantics over BCCSP, Simulations Up-to and Canonical Preorders, Axiomatizing Weak Ready Simulation Semantics over BCCSP, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures