On the axiomatizability of priority. II
type: Item
instance of: scholarly article
title: On the axiomatizability of priority. II
zbMATH Open document ID: 1216.68181
author: Luca Aceto
author: Taolue Chen
author: Bas Luttik
author: Jaco van de Pol
author: Anna Ingolfsdottir
published in: Theoretical Computer Science
publication date: 2011-07-07T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 5918225
zbMATH Keywords: bisimilarity
zbMATH Keywords: equational logic
zbMATH Keywords: process algebra
zbMATH Keywords: priority operator
zbMATH Keywords: non-finitely based algebras
Wikidata QID: Q62047468
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.02.033
OpenAlex ID: W4205992029
cites work: On the axiomatisability of priority
cites work: Q4727412
cites work: Process algebra for synchronous communication
cites work: Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
cites work: Bisimulation can't be traced
cites work: CCS with priority choice
cites work: Priorities in process algebras
cites work: Priority in process algebra.
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Q3777424
cites work: On deciding readiness and failure equivalences for processes
cites work: ALGORITHMIC PROBLEMS IN VARIETIES
cites work: Q3992568
cites work: Q3907077
cites work: A structural approach to operational semantics
DBLP publication ID: journals/tcs/AcetoCILP11
DOI: 10.1016/J.TCS.2011.02.033
description: scientific article; zbMATH DE number 5918225