A Complete Equational Axiomatization for BPAdelta epsilon with Prefix Iteration (original) (raw)
Related papers
A Complete Equational Axiomatization for BPAδε with Prefix Iteration
2016
Basic process algebra with iteration: Completeness of its equational axioms
The Computer Journal, 1994
A complete equational axiomatization for prefix iteration
Information Processing Letters, 1994
Axiomatizations for the perpetual loop in process algebra
ICALP, 1997
A complete equational axiomatization for prefix iteration with silent steps
1995
Finite equational bases in process algebra: Results and open questions
Processes, Terms and Cycles: Steps on the Road to Infinity, 2005
A complete axiomatization for prefix iteration in branching bisimulation
Fundamenta Informaticae, 1996
Mathematical Structures in Computer Science, 1998
Process algebra with recursive operations
Handbook of Process Algebra, 2001
A complete equational axiomatization for MPA with string iteration
Theoretical Computer Science, 1999
Termination modulo equations by abstract commutation with an application to iteration
Theoretical Computer Science, 1997
An equational axiomatization for multi-exit iteration
Information and Computation, 1997
A cook's tour of equational axiomatizations for prefix iteration
Lecture Notes in Computer Science, 1998
Bisimulation Equivalence Is Decidable for All Context-Free Processes
Information and Computation, 1995
1998
Axiomatizing Prefix Iteration with Silent Steps
Information and Computation, 1996
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM, 1993
Equivalence of recursive specifications in process algebra
Information Processing Letters, 2001
The importance of the left merge operator in process algebras
Lecture Notes in Computer Science, 1990
Process Algebra as Abstract Data Types
arXiv (Cornell University), 2010
An Equational Axiomatization of Bisimulation over Regular Expressions
Journal of Logic and Computation, 2002
Bisimulation equivalence is decidable for basic parallel processes
Lecture Notes in Computer Science, 1993
A Process-Theoretic Look at Automata
Lecture Notes in Computer Science, 2010
Standard Automata Theory and Process Algebra
arXiv (Cornell University), 2022
Split-2 Bisimilarity has a Finite Axiomatization over CCS with
Hennessy's Merge
Logical Methods in Computer Science, 2005
1998
Polarized Process Algebra and Program Equivalence
Lecture Notes in Computer Science, 2003
A Non-SOS Operational Semantics for a Process Algebra
Information Processing Letters, 1998
A short proof of the decidability of bisimulation for normed bpa-processes
Information Processing Letters, 1992
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
Lecture Notes in Computer Science, 2010
1989
Towards Action-Refinement in Process Algebras
Information and Computation, 1993
Process algebra with guards: Combining Hoare logic with process algebra
Formal Aspects of Computing, 1994