DocumentCode
2529628
Title
Decidability of bisimulation equivalence for equational graphs of finite out-degree
Author
Sénizergues, Géraud
Author_Institution
Bordeaux I Univ., Talence, France
fYear
1998
fDate
8-11 Nov 1998
Firstpage
120
Lastpage
129
Abstract
The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the η-bisimulation problem for deterministic rational (vectors of) Boolean series on the alphabet of a dpda M. We then exhibit a complete formal system for deducing equivalent pairs of such vectors
Keywords
bisimulation equivalence; decidability; pushdown automata; Boolean series; bisimulation equivalence; decidability; deterministic rational; equational graphs; equivalent pairs; finite out-degree; Automata; Concurrent computing; Equations; Formal languages; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on
Conference_Location
Palo Alto, CA
ISSN
0272-5428
Print_ISBN
0-8186-9172-7
Type
conf
DOI
10.1109/SFCS.1998.743435
Filename
743435
Link To Document