SRBA, Jiří. Completeness Results for Undecidable Bisimilarity Problems. In Proccedings of the 5th International Workshop on Verification of Infinite-State Systems (INFINITY'03). Marseille, France: Universire de Provence, Marseille, 2004, p. 9-22.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Completeness Results for Undecidable Bisimilarity Problems
Name in Czech Uplnostni vysledky pro nerozhodnutelne bisimulacni problemy
Authors SRBA, Jiří (203 Czech Republic, guarantor).
Edition Marseille, France, Proccedings of the 5th International Workshop on Verification of Infinite-State Systems (INFINITY'03), p. 9-22, 14 pp. 2004.
Publisher Universire de Provence, Marseille
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher France
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/04:00010086
Organization unit Faculty of Informatics
Keywords in English high undecidability; bisimilarity
Tags bisimilarity, high undecidability
Changed by Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 18/1/2005 17:32.
Abstract
We establish Sigma_1^1-completeness (in the analytical hierarchy) of weak bisimilarity checking for infinite-state processes generated by pushdown automata and parallel pushdown automata. The results imply Sigma_1^1-completeness of weak bisimilarity for Petri nets and give a negative answer to the open problem stated by Jancar (CAAP'95): ``does the problem of weak bisimilarity for Petri nets belong to Delta_1^1 ?''
Abstract (in Czech)
V clanku je ukazana Sigma^1_1 uplnost slabe bisimilarity pro zasabnikove a paralelni zasobnikove automaty.
Links
GA201/03/1161, research and development projectName: Verifikace nekonečně stavových systémů
Investor: Czech Science Foundation, Verification of infinite-state systems
MSM 143300001, plan (intention)Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů
Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing
PrintDisplayed: 25/4/2024 14:07