Další formáty:
BibTeX
LaTeX
RIS
@article{574582, author = {Křetínský, Mojmír and Řehák, Vojtěch and Strejček, Jan}, article_location = {San Francisco, USA}, article_number = {NS-05-4}, keywords = {process rewrite systems; state extension; infinite-state; (un)decidability; weak bisimulation}, language = {eng}, issn = {0909-3206}, journal = {BRICS Notes Series}, title = {Refining Undecidability Border of Weak Bisimilarity.}, url = {http://www.brics.dk/NS/05/4/}, volume = {2005}, year = {2005} }
TY - JOUR ID - 574582 AU - Křetínský, Mojmír - Řehák, Vojtěch - Strejček, Jan PY - 2005 TI - Refining Undecidability Border of Weak Bisimilarity. JF - BRICS Notes Series VL - 2005 IS - NS-05-4 SP - 3-14 EP - 3-14 SN - 09093206 KW - process rewrite systems KW - state extension KW - infinite-state KW - (un)decidability KW - weak bisimulation UR - http://www.brics.dk/NS/05/4/ 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 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. ER -
KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. Refining Undecidability Border of Weak Bisimilarity. \textit{BRICS Notes Series}. San Francisco, USA, 2005, roč.~2005, NS-05-4, s.~3-14. ISSN~0909-3206.
|