Show simple item record

dc.contributor.authorJančar, Petr
dc.contributor.authorKučera, Antonín
dc.contributor.authorMayr, Richard
dc.date.accessioned2007-09-18T07:01:49Z
dc.date.available2007-09-18T07:01:49Z
dc.date.issued1998
dc.identifier.citationAutomata, languages and programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998. Proceedings. 1998, p. 200-211. Lecture notes in computer science, vol. 1443.en
dc.identifier.isbn978-3-540-64781-2
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/10084/62798
dc.language.isoenen
dc.publisherSpringeren
dc.relation.ispartofseriesAutomata, languages and programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998. Proceedingsen
dc.relation.urihttp://dx.doi.org/10.1007/BFb0055035en
dc.titleDeciding bisimulation-like equivalences with finite-state processesen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.description.abstract-enWe design a general method for proving decidability of bisimulation-like equivalences between infinite-state processes and finite-state ones. We apply this method to the class of PAD processes, which strictly subsumes PA and push-down (PDA) processes, showing that a large class of bisimulation-like equivalences (including e.g. strong and weak bisimilarity) is decidable between PAD and finite-state processes. On the other hand, we also demonstrate that no ‘reasonable’ bisimulation-like equivalence is decidable between state-extended PA processes and finite-state ones. Furthermore, weak bisimilarity with finite-state processes is shown to be undecidable even for state-extended BPP (which are also known as ‘parallel pushdown processes’).en
dc.identifier.doi10.1007/BFb0055035
dc.identifier.wos000082774400018


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Publikační činnost VŠB-TUO / Publications of VŠB-TUO [2627]
    Kolekce obsahuje bibliografické záznamy publikační činnosti (článků) akademických pracovníků VŠB-TUO v časopisech (a v Lecture Notes in Computer Science) registrovaných ve Web of Science od roku 1990 po současnost.

Show simple item record