On the axiomatizability of priority II (original) (raw)
Related papers
On the Axiomatizability of Priority
2006
On the axiomatisability of priority
Mathematical Structures in Computer Science, 2008
Finite equational bases in process algebra: Results and open questions
Processes, Terms and Cycles: Steps on the Road to Infinity, 2005
Priority and abstraction in process algebra
Foundation of Software …, 1994
Axiomatization of Bisimulation Based Relations
2005
1998
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
Process Equivalences as Global Bisimulations1
Journal of Universal Computer …, 2006
Process Equivalences as Global Bisimulations
Zenodo (CERN European Organization for Nuclear Research), 2006
Bisimulation Equivalence Is Decidable for All Context-Free Processes
Information and Computation, 1995
A Complete Equational Axiomatization for BPAδε with Prefix Iteration
2016
Relating maximality-based semantics to action refinement in process algebras
Djamel-Eddine Saïdouni, Djamel Eddine Saïdouni, Jean-pierre Courtiat
Towards Action-Refinement in Process Algebras
Information and Computation, 1993
Mathematical Structures in Computer Science, 1998
Process theory based on bisimulation semantics
1989
Basic process algebra with iteration: Completeness of its equational axioms
The Computer Journal, 1994
A Complete Equational Axiomatization for BPAdelta epsilon with Prefix Iteration
Process Algebra as Abstract Data Types
arXiv (Cornell University), 2010
Bisimulation equivalence is decidable for basic parallel processes
Lecture Notes in Computer Science, 1993
Axiomatization of a Class of Parametrised Bisimilarities
Perspectives in Concurrency Theory
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM, 1993
Characteristic formulae for fixed-point semantics: a general framework
Mathematical Structures in Computer Science, 2012
On the Unification of Process Semantics: Equational Semantics
Electronic Notes in Theoretical Computer Science, 2009
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
2008
A complete equational axiomatization for prefix iteration
Information Processing Letters, 1994
On the decidability of process equivalences for the π-calculus
Theoretical Computer Science, 1997
A Non-SOS Operational Semantics for a Process Algebra
Information Processing Letters, 1998
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Electronic Notes in Theoretical Computer Science, 2008
Axiomatizations for the perpetual loop in process algebra
ICALP, 1997
Polarized Process Algebra and Program Equivalence
Lecture Notes in Computer Science, 2003
Universal axioms for bisimulations
Theoretical Computer Science, 1993