KUČERA, Antonín and Richard MAYR. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. J.C.M. Baeten, S. Mauw (Eds.). In Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99). Berlin: Springer, 1999. p. 368-382. Lecture Notes in Computer Science, vol. 1664. ISBN 3-540-66425-4.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
Authors KUČERA, Antonín and Richard MAYR.
J.C.M. Baeten, S. Mauw (Eds.).
Edition Berlin, Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99), p. 368-382, Lecture Notes in Computer Science, vol. 1664, 1999.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study Computer hardware and architecture
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/99:00001106
Organization unit Faculty of Informatics
ISBN 3-540-66425-4
UT WoS 000087625300026
Keywords in English verification; concurrency; weak bisimilarity; infinite-state systems
Tags concurrency, infinite-state systems, verification, weak bisimilarity
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:47.
Links
GA201/98/P046, research and development projectName: Rozhodnutelné problémy v algebrách procesů
Investor: Czech Science Foundation, Standard Projects
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, Research Intents
PrintDisplayed: 17/11/2019 21:54