2-Nested Simulation Is Not Finitely Equationally Axiomatizable

2-nested simulation was introduced by Groote and Vaandrager [10] as the coarsest equivalence included in completed trace equivalence for which the tyft/tyxt format is a congruence format. In the linear time-branching time spectrum of van Glabbeek [8], 2-nested simulation is one of the few equivalences for which no finite equational axiomatization is presented. In this paper we prove that such an axiomatization does not exist for 2-nested simulation.

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

[2]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[3]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[4]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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

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

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

[8]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

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

[10]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[11]  Jan Friso Groote.  A New Strategy for Proving omega-Completeness applied to Process Algebra , 1990, CONCUR.

[12]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[13]  Huimin Lin.  An Interactive Proof Tool for Process Algebras , 1992, STACS.

[14]  B. Mitchell,et al.  Modal Observation Equivalence of Processes , 1995 .

[15]  Sandeep K. Shukla,et al.  The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach , 1996, Satisfiability Problem: Theory and Applications.

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

[17]  Luca Aceto,et al.  A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces , 1998, Mathematical Structures in Computer Science.

[18]  Ivan Damgård,et al.  Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.

[19]  Thomas Hune,et al.  Modeling a Language for Embedded Systems in Timed Automata , 2000 .

[20]  Glynn Winskel,et al.  Language, Semantics, and Methods for Cryptographic Protocols , 2000 .

[21]  Olivier Danvy,et al.  Syntactic accidents in program analysis: on the impact of the CPS transformation , 2000, ICFP '00.

[22]  Vinodchandran Variyam.  A Note on NP \ coNP=poly , 2000 .

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

[24]  Jirí Srba,et al.  Matching Modulo Associativity and Idempotency Is NP-Complete , 2000, MFCS.

[25]  Jirí Srba.  Complexity of Weak Bisimilarity and Regularity for BPA and BPP , 2000, EXPRESS.

[26]  Luca Aceto,et al.  2-Nested Simulation Is Not Finitely Equationally Axiomatizable , 2000, STACS.

[27]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

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