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. |
Other formats:
BibTeX
LaTeX
RIS
@article{555141, author = {Moller, Faron and Smolka, Scot and Srba, Jiří}, article_location = {Netherlands}, article_number = {?}, keywords = {bisimilarity; complexity}, language = {eng}, issn = {0890-5401}, journal = {Information and Computation}, note = {To appear.}, title = {On the Computational Complexity of Bisimulation, Redux}, url = {http://www.brics.dk/~srba/publ.html}, volume = {?}, year = {2004} }
TY - JOUR ID - 555141 AU - Moller, Faron - Smolka, Scot - Srba, Jiří PY - 2004 TI - On the Computational Complexity of Bisimulation, Redux JF - Information and Computation VL - ? IS - ? SP - ? EP - ? PB - Elsevier Science SN - 08905401 N1 - To appear. KW - bisimilarity KW - complexity UR - http://www.brics.dk/~srba/publ.html N2 - 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. ER -
MOLLER, Faron, Scot SMOLKA and Jiří SRBA. On the Computational Complexity of Bisimulation, Redux. \textit{Information and Computation}. Netherlands: Elsevier Science, 2004, ?, ?, p.~?, 20 pp. ISSN~0890-5401.
|