Bisimilarity is not finitely based over BPA with interrupt

Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Sumit Nain

Rannsóknarafurð: Framlag til fræðitímaritsGreinritrýni

8 Tilvitnanir (Scopus)

Útdráttur

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.

Upprunalegt tungumálEnska
Síður (frá-til)60-81
Síðufjöldi22
FræðitímaritTheoretical Computer Science
Bindi366
Númer tölublaðs1-2
DOI
ÚtgáfustaðaÚtgefið - 16 nóv. 2006

Fingerprint

Sökktu þér í rannsóknarefni „Bisimilarity is not finitely based over BPA with interrupt“. Saman myndar þetta einstakt fingrafar.

Vitna í þetta