On the axiomatisability of priority

DOI10.1017/S0960129507006524zbMATH Open1141.68042OpenAlexW2028222735MaRDI QIDQ5458057FDOQ5458057

Authors: Luca Aceto, Taolue Chen, Anna Ingolfsdottir, Wan Fokkink 

Publication date: 10 April 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129507006524

Recommendations

• On the Axiomatizability of Priority
• On the axiomatizability of priority. II
• On the axiomatisability of priority. III: Priority strikes again
• Priorities in process algebras
• scientific article; zbMATH DE number 1670867

zbMATH Keywords

process algebrabisimulation equivalence

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced
• Priorities in process algebras
• CCS with priority choice
• Nonaxiomatisability of equivalences over finite state processes
• CCS with Hennessy's merge has no finite-equational axiomatization
• On the expressive power of CCS
• Bisimilarity is not finitely based over BPA with interrupt

Cited In (16)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Priority Arguments and Epsilon Substitutions
• The equational theory of prebisimilarity over basic CCS with divergence
• Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
• The Saga of the Axiomatization of Parallel Composition
• On the axiomatizability of priority. II
• Is Observational Congruence Axiomatisable in Equational Horn Logic?
• Replacement freeness: a criterion for separating process calculi
• On the Axiomatizability of Priority
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• On the axiomatisability of priority. III: Priority strikes again
• Non-commutative propositional logic with short-circuit evaluation
• Axiomatizing weak simulation semantics over BCCSP
• An independent axiomatisation for free short-circuit logic

This page was built for publication: On the axiomatisability of priority

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458057)