Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{616549,
author = {Křetínský, Mojmír and Řehák, Vojtěch and Strejček, Jan},
address = {Amsterdam, The Netherlands},
booktitle = {Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05)},
edition = {2006},
keywords = {process rewrite systems; state extension; infinite-state; decidability; weak bisimilarity},
language = {eng},
location = {Amsterdam, The Netherlands},
note = {modified and extended version of INFINITY 2005 paper},
pages = {17-36},
publisher = {Elsevier Science},
title = {Refining Undecidability Border of Weak Bisimilarity.},
url = {http://dx.doi.org/10.1016/j.entcs.2005.11.014},
year = {2006}
}
TY - JOUR
ID - 616549
AU - Křetínský, Mojmír - Řehák, Vojtěch - Strejček, Jan
PY - 2006
TI - Refining Undecidability Border of Weak Bisimilarity.
PB - Elsevier Science
CY - Amsterdam, The Netherlands
N1 - modified and extended version of INFINITY 2005 paper
KW - process rewrite systems
KW - state extension
KW - infinite-state
KW - decidability
KW - weak bisimilarity
UR - http://dx.doi.org/10.1016/j.entcs.2005.11.014
N2 - Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes by showing that the equivalence remains undecidable for weakly extended versions of BPA and BPP. In fact, we show that the weak bisimulation equivalence problem is undecidable even for normed subclasses of BPA and BPP extended with a finite constraint system.
ER -
KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. Refining Undecidability Border of Weak Bisimilarity. In \textit{Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05)}. 2006. vyd. Amsterdam, The Netherlands: Elsevier Science, 2006, s.~17-36. ISSN~1571-0661.
|
