Result: Bisimilarity is not finitely based over BPA with interrupt
Title:
Bisimilarity is not finitely based over BPA with interrupt
Authors:
Source:
Algebra and coalgebra in computer science (Swansea, 3-6 September 2005)Lecture notes in computer science. :52-66
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 31 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Algèbre opérateur, Operator algebra, Algebra operador, Algèbre processus, Process algebra, Algebra proceso, Bisimulation, Bisimulación, Coalgèbre, Coalgebra, Langage clos, Closed language, Lenguaje cerrado, Modélisation, Modeling, Modelización
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Brics (Basic Research in Computer Science), Centre of the Danish National Research Foundation, Department of Computer Science, Aalborg University, Fr. Bajersvej 7B, 9220 Aalborg, Denmark
School of Computer Science, Reykjavík University, Ofanleiti 2, 103 Reykjavik, Iceland
Vrije Universiteit Amsterdam, Department of Computer Science, Section Theoretical Computer Science, De Boelelaan 1081a, 1081 HV Amsterdam, Netherlands
Department of Computer Science, University of Iceland, 107 Reykjavik, Iceland
School of Computer Science, Reykjavík University, Ofanleiti 2, 103 Reykjavik, Iceland
Vrije Universiteit Amsterdam, Department of Computer Science, Section Theoretical Computer Science, De Boelelaan 1081a, 1081 HV Amsterdam, Netherlands
Department of Computer Science, University of Iceland, 107 Reykjavik, Iceland
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17115997
Database:
PASCAL Archive
Further Information
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 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.