Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
From MaRDI portal
Publication:1944909
DOI10.1016/j.ipl.2011.01.015zbMath1260.68252OpenAlexW1984568289MaRDI QIDQ1944909
Anna Ingólfsdóttir, Luca Aceto, Carlos Gregorio Rodríguez, David de Frutos-Escrig
Publication date: 28 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.01.015
process algebraequational logicconcurrencynon-finitely based algebrasready simulationcomplete simulation
Related Items (2)
Axiomatizing weak simulation semantics over BCCSP ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finite alphabets and infinite bases
- Lifting non-finite axiomatizability results to extensions of process algebras
- The equational theory of prebisimilarity over basic CCS with divergence
- Bisimulation through probabilistic testing
- Impossible futures and determinism
- A structural approach to operational semantics
- On the Unification of Process Semantics: Equational Semantics
- Algebraic laws for nondeterminism and concurrency
- Bisimulation can't be traced
- A finite equational base for CCS with left merge and communication merge
- On the axiomatisability of priority
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet