On the axiomatizability of priority. II
DOI10.1016/J.TCS.2011.02.033zbMATH Open1216.68181DBLPjournals/tcs/AcetoCILP11OpenAlexW4205992029WikidataQ62047468 ScholiaQ62047468MaRDI QIDQ549169FDOQ549169
Authors: Luca Aceto, Taolue Chen, Bas Luttik, Jaco van de Pol, Anna Ingolfsdottir 
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.033
Recommendations
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A structural approach to operational semantics
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- ALGORITHMIC PROBLEMS IN VARIETIES
- Priorities in process algebras
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- Priority in process algebra.
- Title not available (Why is that?)
- CCS with priority choice
- On deciding readiness and failure equivalences for processes
- On the axiomatisability of priority
Cited In (6)
- On the expressibility of priority
- On the axiomatisability of priority
- On the Axiomatizability of Priority
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- The quest for equational axiomatizations of parallel composition: status and open problems
- On the axiomatisability of priority. III: Priority strikes again
This page was built for publication: On the axiomatizability of priority. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549169)
