J
1998
Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time
KUČERA, Antonín and Mayr RICHARD
Basic information
Original name
Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time
Edition
Technical Report TUM, Germany, Technical University Munich, 1998
Other information
Type of outcome
Článek v odborném periodiku
Field of Study
20206 Computer hardware and architecture
Country of publisher
Germany
Confidentiality degree
není předmětem státního či obchodního tajemství
RIV identification code
RIV/00216224:14330/98:00001760
Organization unit
Faculty of Informatics
Keywords in English
process algebras; bisimilarity; finite-state systems
Links
| GA201/98/P046, research and development project | | Name: 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 |
|
Displayed: 5/11/2024 02:38