SRBA, Jiří. Undecidability of Weak Bisimilarity for Pushdown Processes. In Proceedings of 13th International Conference on Concurrency Theory (CONCUR'02). Holland: Springer-Verlag, 2002, p. 579-593.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Undecidability of Weak Bisimilarity for Pushdown Processes
Authors SRBA, Jiří (203 Czech Republic, guarantor).
Edition Holland, Proceedings of 13th International Conference on Concurrency Theory (CONCUR'02), p. 579-593, 2002.
Publisher Springer-Verlag
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10000 1. Natural Sciences
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/02:00006588
Organization unit Faculty of Informatics
Keywords in English weak bisimilarity; pushdown automata; infinite systems
Tags infinite systems, pushdown automata, weak bisimilarity
Changed by Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 21/5/2003 09:47.
Abstract
We prove undecidability of the problem whether a given pair of pushdown processes is weakly bisimilar. We also show that this undecidability result extends to a subclass of pushdown processes satisfying the normedness condition.
Links
GA201/00/0400, research and development projectName: Nekonečně stavové souběžné systémy - modely a verifikace
Investor: Czech Science Foundation, Infinite state concurrent systems - models and verification
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: 30/4/2024 12:07