MOLLER, Faron, Scot SMOLKA and Jiří SRBA. On the Computational Complexity of Bisimulation, Redux. Information and Computation, Netherlands: Elsevier Science, 2004, ?, ?, p. ? ISSN 0890-5401.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name On the Computational Complexity of Bisimulation, Redux
Name in Czech Vypocetni slozitost bisimulace
Authors MOLLER, Faron (752 Sweden), Scot SMOLKA (840 United States of America) and Jiří SRBA (203 Czechia, guarantor).
Edition Information and Computation, Netherlands, Elsevier Science, 2004, 0890-5401.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
WWW URL
Impact factor Impact factor: 0.920
RIV identification code RIV/00216224:14330/04:00010071
Organization unit Faculty of Informatics
UT WoS 000224885700004
Keywords in English bisimilarity; complexity
Tags bisimilarity, complexity
Changed by Changed by: Mgr. Jiří Srba, Ph.D., učo 2841. Changed: 18/1/2005 17:27.
Abstract
Paris Kanellakis and the second author (Smolka) were among the first to investigate the computational complexity of bisimulation, and the first and third authors (Moller and Srba) have long-established track records in the field. Smolka and Moller have also written a brief survey about the computational complexity of bisimulation [Moller,Smolka'95]. The authors believe that the special issue of Information and Computation devoted to PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop represents an ideal opportunity for an up-to-date look at the subject.
Abstract (in Czech)
Jedna se o prehledovy clanek, ktery poskytuje seznam vysledku a odkazu na ne z oblasti porovnavani nekonecne stavovych systemu vzhledem k semantickym ekvivalencim.
Links
GA201/03/1161, research and development projectName: Verifikace nekonečně stavových systémů
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: 13/8/2020 03:17