Bisimilarity is not finitely based over BPA with interrupt

This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Algebra with the interrupt operator. Moreover, it is shown that the collection of closed equations over this language is also not finitely based. In sharp contrast to these results, the collection of closed equations over the language BPA enriched with the disrupt operator is proven to be finitely based.

[1]  Henning Korsholm Rohde,et al.  Measuring the Propagation of Information in Partial Evaluation , 2005 .

[2]  Andrew Twigg,et al.  Distributed Approximation of Fixed-Points in Trust Structures , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[3]  Luca Aceto,et al.  Bisimilarity is not finitely based over BPA with interrupt , 2006, Theor. Comput. Sci..

[4]  Jirí Srba,et al.  On Counting the Number of Consistent Genotype Assignments for Pedigrees , 2005, FSTTCS.

[5]  Luca Aceto,et al.  The max-plus algebra of the natural numbers has no finite equational basis , 1999, Theor. Comput. Sci..

[6]  Bas Luttik,et al.  An omega-Complete Equational Specification of Interleaving , 2000, ICALP.

[7]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[8]  Wan Fokkink,et al.  On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces , 2003, ICALP.

[9]  FokkinkWan,et al.  A menagerie of non-finitely based process semantics over BPA* - from ready simulation to completed traces , 1998 .

[10]  Bolette Ammitzbøll Jurik,et al.  An algorithm for Exact Satisfiability analysed with the number of clauses as parameter , 2006, Inf. Process. Lett..

[11]  Karen L. Bernstein.  A congruence theorem for structured operational semantics of higher-order languages , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[12]  Christian Kirkegaard,et al.  Type Checking with XML Schema in XACT , 2005, PLAN-X.

[13]  Jens Groth,et al.  Strong Privacy Protection in Electronic Voting , 2004 .

[14]  Mads Sig Ager,et al.  From Natural Semantics to Abstract Machines , 2004, LOPSTR.

[15]  O. Danvy,et al.  A Simple Proof of a Folklore Theorem about Delimited Control , 2005 .

[16]  Glynn Winskel,et al.  New-HOPLA: A Higher-order Process Language with Name Generation , 2004, IFIP TCS.

[17]  Wan Fokkink,et al.  On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds , 2004, FoSSaCS.

[18]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[19]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[20]  J. Bergstra,et al.  Mode transfer in process algebra , 2000 .

[21]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[22]  Olivier Danvy,et al.  On obtaining the Boyer-Moore string-matching algorithm by partial evaluation , 2006, Inf. Process. Lett..

[23]  Faron Moller,et al.  The nonexistence of finite axiomatisations for CCS congruences , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[24]  Glynn Winskel,et al.  Profunctors, open maps and bisimulation , 2004, Mathematical Structures in Computer Science.

[25]  Peter Sewell,et al.  Nonaxiomatisability of Equivalences over Finite State Processes , 1997, Ann. Pure Appl. Log..

[26]  Bas Luttik,et al.  CCS with Hennessy's merge has no finite-equational axiomatization , 2005, Theor. Comput. Sci..

[27]  Jesper Makholm Byskov.  Maker-Maker and Maker-Breaker Games are PSPACE-Complete , 2004 .

[28]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

[29]  Matthew Hennessy,et al.  Axiomatising Finite Concurrent Processes , 1988, SIAM J. Comput..

[30]  Peter Rossmanith,et al.  Maximum Exact Satisfiability: NP-completeness Proofs and Exact Algorithms , 2004 .

[31]  J. Conway.  Regular algebra and finite machines , 1971 .

[32]  Luca Aceto,et al.  Nested Semantics over Finite Trees are Equationally Hard: Invited Talk , 2003, EXPRESS.

[33]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[34]  Sjouke Mauw,et al.  PSF : a process specification formalism , 1991 .

[35]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[36]  Faron Moller.  The Importance of the Left Merge Operator in Process Algebras , 1990, ICALP.

[37]  Karl Krukow,et al.  An Operational Semantics for Trust Policies , 2005 .

[38]  Hans Hüttel,et al.  Recursion vs. Replication in Simple Cryptographic Protocols , 2004 .

[39]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[40]  Ed Brinksma,et al.  A tutorial on LOTOS , 1985, PSTV.

[41]  J. Bergstra,et al.  Fixed point semantics in process algebras : (preprint) , 1982 .

[42]  Bard Bloom,et al.  On the Expressive Power of CCS , 1995, FSTTCS.

[43]  Luca Aceto,et al.  On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers , 1999, STACS.

[44]  Olivier Danvy,et al.  An Operational Foundation for Delimited Continuations in the CPS Hierarchy , 2005, Log. Methods Comput. Sci..