KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Refining Undecidability Border of Weak Bisimilarity. (Refining Undecidability Border of Weak Bisimilarity). Online. In Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05). 2006th ed. Amsterdam, The Netherlands: Elsevier Science, 2006. p. 17-36. ISSN 1571-0661. [citováno 2024-04-23]
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Refining Undecidability Border of Weak Bisimilarity.
Name in Czech Zjemneni hranice nerozhodnutelnosti slabe bisimulace
Authors KŘETÍNSKÝ, Mojmír (203 Czech Republic, guarantor), Vojtěch ŘEHÁK (203 Czech Republic) and Jan STREJČEK (203 Czech Republic)
Edition 2006. vyd. Amsterdam, The Netherlands, Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05), p. 17-36, 20 pp. 2006.
Publisher Elsevier Science
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/06:00015292
Organization unit Faculty of Informatics
ISSN 1571-0661
Keywords in English process rewrite systems; state extension; infinite-state; decidability; weak bisimilarity
Tags decidability, infinite-state, process rewrite systems, state extension, weak bisimilarity
Tags International impact, Reviewed
Changed by Changed by: doc. RNDr. Vojtěch Řehák, Ph.D., učo 3721. Changed: 23/6/2009 16:53.
Abstract
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.
Abstract (in Czech)
Časopisecké vydání sborníku INFINITY2005. Ukazujeme, že slabá bisimulace zůstává nerozhodnutelná i pro slabě rozšířené varianty tříd BPA a BPP.
Links
GD102/05/H050, research and development projectName: Integrovaný přístup k výchově studentů DSP v oblasti paralelních a distribuovaných systémů
Investor: Czech Science Foundation, Integrated approach to education of PhD students in the area of parallel and distributed systems
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
1ET408050503, research and development projectName: Techniky automatické verifikace a validace softwarových a hardwarových systémů
Investor: Academy of Sciences of the Czech Republic, Techniques for automatic verification and validation of software nad hardware systems
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 23/4/2024 18:36