Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
DOI10.1016/J.IPL.2011.01.015zbMATH Open1260.68252OpenAlexW1984568289MaRDI QIDQ1944909FDOQ1944909
Authors: Luca Aceto, Anna Ingolfsdottir, David de Frutos Escrig, Carlos Gregorio Rodríguez 
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
Recommendations
concurrencyprocess algebraequational logicnon-finitely based algebrasready simulationcomplete simulation
Cites Work
- A structural approach to operational semantics
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- Bisimulation through probabilistic testing
- Impossible futures and determinism
- Processes, Terms and Cycles: Steps on the Road to Infinity
- On the axiomatisability of priority
- A finite equational base for CCS with left merge and communication merge
- On the unification of process semantics: equational semantics
- 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
Cited In (5)
This page was built for publication: Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944909)
