Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
type: Item
instance of: scholarly article
title: Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
zbMATH Open document ID: 1260.68252
author: Luca Aceto
author: Anna Ingolfsdottir
author: David de Frutos Escrig
author: Carlos Gregorio Rodríguez
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 6149195
zbMATH Keywords: concurrency
zbMATH Keywords: process algebra
zbMATH Keywords: complete simulation
zbMATH Keywords: ready simulation
zbMATH Keywords: equational logic
zbMATH Keywords: non-finitely based algebras
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.01.015
OpenAlex ID: W1984568289
cites work: The equational theory of prebisimilarity over basic CCS with divergence
cites work: On the axiomatisability of priority
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: A finite equational base for CCS with left merge and communication merge
cites work: Lifting non-finite axiomatizability results to extensions of process algebras
cites work: Bisimulation can't be traced
cites work: On finite alphabets and infinite bases
cites work: On the unification of process semantics: equational semantics
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Q3777424
cites work: Bisimulation through probabilistic testing
cites work: Q3992568
cites work: Q3907077
cites work: A structural approach to operational semantics
cites work: Impossible futures and determinism
DOI: 10.1016/J.IPL.2011.01.015
description: scientific article; zbMATH DE number 6149195