2006
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
JANČAR, Petr a Jiří SRBAZákladní údaje
Originální název
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
Název česky
Nerozhodnutelnost Bisimulace na Prefixovych Prepisovacich Systemech
Autoři
JANČAR, Petr (203 Česká republika) a Jiří SRBA (203 Česká republika, garant)
Vydání
LNCS, Foundations of Software Science and Computation Structures (FOSSACS'06), Netherlands, Spinger-Verlag, 2006
Další údaje
Jazyk
angličtina
Typ výsledku
Článek v odborném periodiku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Nizozemské království
Utajení
není předmětem státního či obchodního tajemství
Kód RIV
RIV/00216224:14330/06:00015979
Organizační jednotka
Fakulta informatiky
UT WoS
000237082000019
Klíčová slova anglicky
bisimilarity; undecidability; prefix rewriting
Štítky
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 6. 7. 2007 09:01, RNDr. JUDr. Vladimír Šmíd, CSc.
V originále
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.
Česky
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.
Návaznosti
GA201/03/1161, projekt VaV |
| ||
MSM 143300001, záměr |
| ||
MSM0021622419, záměr |
| ||
1M0545, projekt VaV |
|