Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet

DOI10.1016/J.IPL.2011.01.015MaRDI QIDQ1944909zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

concurrencyprocess algebraequational logicnon-finitely based algebrasready simulationcomplete simulation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Trace simulation semantics is not finitely based over BCCSP
• Foundations of Software Science and Computation Structures
• On Finite Alphabets and Infinite Bases III: Simulation
• The equational theory of weak complete simulation semantics over BCCSP
• On finite alphabets and infinite bases

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A finite equational base for CCS with left merge and communication merge
• A structural approach to operational semantics
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced
• Bisimulation through probabilistic testing
• Impossible futures and determinism
• Lifting non-finite axiomatizability results to extensions of process algebras
• On finite alphabets and infinite bases
• On the axiomatisability of priority
• On the unification of process semantics: equational semantics
• Processes, Terms and Cycles: Steps on the Road to Infinity
• The equational theory of prebisimilarity over basic CCS with divergence
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.

Cited in

(5)

• Axiomatizing weak ready simulation semantics over BCCSP
• The equational theory of weak complete simulation semantics over BCCSP
• Algebra and Coalgebra in Computer Science
• Axiomatizing weak simulation semantics over BCCSP
• Trace simulation semantics is not finitely based over BCCSP

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)