Bisimilarity is not finitely based over BPA with interrupt
type: Item
instance of: scholarly article
title: Bisimilarity is not finitely based over BPA with interrupt
zbMATH Open document ID: 1154.68084
author: Luca Aceto
author: Sumit Nain
author: Wan Fokkink
author: Anna Ingolfsdottir
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03C05
Mathematics Subject Classification ID: 08A70
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5083519
zbMATH Keywords: concurrency
zbMATH Keywords: process algebra
zbMATH Keywords: basic process algebra (BPA)
zbMATH Keywords: interrupt
zbMATH Keywords: disrupt
zbMATH Keywords: bisimulation
zbMATH Keywords: equational logic
zbMATH Keywords: complete axiomatizations
zbMATH Keywords: non-finitely based algebras
zbMATH Keywords: expressiveness
describes a project that uses: ML
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.07.003
OpenAlex ID: W2108192909
cites work: Q4501538
cites work: The max-plus algebra of the natural numbers has no finite equational basis
cites work: Nested semantics over finite trees are equationally hard
cites work: A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
cites work: CCS with Hennessy's merge has no finite-equational axiomatization
cites work: Algebra and Coalgebra in Computer Science
cites work: Q4727412
cites work: Decidability of bisimulation equivalence for process generating context-free languages
cites work: Q3951525
cites work: Process algebra for synchronous communication
cites work: Q4449168
cites work: Q5639639
cites work: On the expressive power of CCS
cites work: Q2754192
cites work: Foundations of Software Science and Computation Structures
cites work: The equational theory of pomsets
cites work: Axiomatising Finite Concurrent Processes
cites work: Q3992568
cites work: Q4038732
cites work: Q3907077
cites work: Q5596826
cites work: Nonaxiomatisability of equivalences over finite state processes
DOI: 10.1016/J.TCS.2006.07.003
description: scientific article; zbMATH DE number 5083519