KUČERA, Antonín and Mayr RICHARD. Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time. Technical Report TUM. Germany: Technical University Munich, vol. 1998, TUM-I9830, p. 1-28, 1998.
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 Mayr RICHARD.
Edition Technical Report TUM, Germany, Technical University Munich, 1998.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 20206 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/98:00001760
Organization unit Faculty of Informatics
UT WoS 000087625300026
Keywords in English process algebras; bisimilarity; finite-state systems
Tags bisimilarity, finite-state systems, process algebras
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 14:09.
Links
GA201/98/P046, research and development projectName: Rozhodnutelné problémy v algebrách procesů
Investor: Czech Science Foundation, (Un)decidable Problems in Process Algebras
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: 28/3/2024 18:01