2-Nested Simulation Is Not Finitely Equationally Axiomatizable

Authors:
Luca Aceto;Wan Fokkink;Anna Ingólfsdóttir
Affiliations:
-;-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 12
Cited 2

The equational theory of pomsets

Theoretical Computer Science
Structured operational semantics and bisimulation as a congruence

Information and Computation
Formal verification of parallel programs

Communications of the ACM
Communication and Concurrency

Communication and Concurrency
The Importance of the Left Merge Operator in Process Algebras

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
An Interactive Proof Tool for Process Algebras

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A New Strategy for Proving omega-Completeness applied to Process Algebra

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time-Branching Time Spectrum (Extended Abstract)

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The max-plus algebra of the natural numbers has no finite equational basis

Theoretical Computer Science
A menagerie of non-finitely based process semantics over BPA* - from ready simulation to completed traces

Mathematical Structures in Computer Science
An algebraic definition of simulation between programs

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence

A finite basis for failure semantics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Visibly pushdown automata: from language equivalence to simulation and bisimulation

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.