Abstract
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by Senizergues (1998, 2005) who showed the decidability for regular (or equational) graphs of finite out-degree (which include unnormed pushdown processes). The question of decidability of bisimilarity for a more general class of so called Type -1 systems (generated by prefix rewrite rules of the form R -a-> w where R is a regular language) was left open; this was repeatedly indicated by both Stirling and Senizergues. Here we answer the question negatively, i.e., we show undecidability of bisimilarity on Type -1 systems, even in the normed case. We complete the picture by considering classes of systems that use rewrite rules of the form w -a-> R and R1 -a-> R2 and show when they yield low undecidability (Pi^0_1-completeness) and when high undecidability (Sigma^1_1-completeness), all with and without the assumption of normedness.
Originalsprog | Engelsk |
---|---|
Titel | Foundations of Software Science and Computation Structures : Proceedings of the 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006 |
Antal sider | 15 |
Forlag | IEEE Computer Society Press |
Publikationsdato | 2006 |
Sider | 277-291 |
ISBN (Trykt) | 3540330453 |
DOI | |
Status | Udgivet - 2006 |
Begivenhed | Foundations of Software Science and Computation Structures (FOSSACS'06) - Vienna, Tyskland Varighed: 25 mar. 2006 → 31 mar. 2006 Konferencens nummer: 9 |
Konference
Konference | Foundations of Software Science and Computation Structures (FOSSACS'06) |
---|---|
Nummer | 9 |
Land/Område | Tyskland |
By | Vienna |
Periode | 25/03/2006 → 31/03/2006 |
Navn | Lecture Notes in Computer Science |
---|---|
Nummer | 3921 |
ISSN | 0302-9743 |