On the Computational Complexity of Bisimulation, Redux

MOLLER, Faron, Scot SMOLKA and Jiří SRBA. On the Computational Complexity of Bisimulation, Redux. Information and Computation. Netherlands: Elsevier Science, 2004, ?, ?, p. ?, 20 pp. ISSN 0890-5401.

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 Czech Republic, guarantor)

Edition

Information and Computation, Netherlands, Elsevier Science, 2004, 0890-5401

---

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Netherlands

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

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

---

Abstract

V originále

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.

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 project	Name: Verifikace nekonečně stavových systémů Investor: Czech Science Foundation, Verification of infinite-state systems
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