On the axiomatisability of priority
From MaRDI portal
Publication:5458057
Recommendations
Cites work
- Algebraic laws for nondeterminism and concurrency
- Bisimilarity is not finitely based over BPA with interrupt
- Bisimulation can't be traced
- CCS with Hennessy's merge has no finite-equational axiomatization
- CCS with priority choice
- Nonaxiomatisability of equivalences over finite state processes
- On the expressive power of CCS
- Priorities in process algebras
- Process algebra for synchronous communication
Cited in
(16)- On the axiomatizability of priority. II
- Is Observational Congruence Axiomatisable in Equational Horn Logic?
- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
- scientific article; zbMATH DE number 1951598 (Why is no real title available?)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- The equational theory of prebisimilarity over basic CCS with divergence
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- Replacement freeness: a criterion for separating process calculi
- The Saga of the Axiomatization of Parallel Composition
- On the axiomatisability of priority. III: Priority strikes again
- Non-commutative propositional logic with short-circuit evaluation
- Priority Arguments and Epsilon Substitutions
- An independent axiomatisation for free short-circuit logic
- scientific article; zbMATH DE number 1421069 (Why is no real title available?)
- Axiomatizing weak simulation semantics over BCCSP
- On the Axiomatizability of Priority
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)