Bisimilarity is not finitely based over BPA with interrupt

Authors:
Luca Aceto;Wan Fokkink;Anna Ingolfsdottir;Sumit Nain
Affiliations:
BRICS (Basic Research in Comp. Sci.), Ctr. of the Danish Natl. Res. Fdn., Dept. of Comp. Sci., Aalborg Univ., Aalborg Ø, Denmark and Dept. of Comp. Sci., Sch. of Sci. and Eng., Reykjavík ...;CWI, Department of Software Engineering, SJ Amsterdam, The Netherlands and Department of Computer Science, Section Theoretical Computer Science, Vrije Universiteit Amsterdam, HV Amsterdam, The Net ...;BRICS (Basic Research in Comp. Sci.), Ctr. of the Danish Natl. Res. Fdn., Dept. of Comp. Sci., Aalborg Univ., Aalborg Ø, Denmark and Dept. of Comp. Sci., Sch. of Sci. and Eng., Reykjavík ...;Department of Computer Science, Rice University, Houston, TX
Venue:
Theoretical Computer Science - Algebra and coalgebra in computer science
Year:
2006

Citing 17
Cited 4

The equational theory of pomsets

Theoretical Computer Science
Axiomatising finite concurrent processes

SIAM Journal on Computing
A new strategy for proving &ohgr;-completeness applied to process algebra

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
The Definition of Standard ML

The Definition of Standard ML
A tutorial on LOTOS

Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
The Importance of the Left Merge Operator in Process Algebras

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Congruence Theorem for Structured Operational Semantics with Predicates

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On the Expressive Power of CCS

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
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
Nested semantics over finite trees are equationally hard

Information and Computation
CCS with Hennessy's merge has no finite-equational axiomatization

Theoretical Computer Science - Expressiveness in concurrency
On the axiomatizability of ready traces, ready simulation, and failure traces

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Bisimilarity is not finitely based over BPA with interrupt

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

On the axiomatisability of priority

Mathematical Structures in Computer Science
On the expressive power of primitives for compensation handling

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Rule formats for distributivity

Theoretical Computer Science
The saga of the axiomatization of parallel composition

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 (BPA) 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.