Show simple item record

dc.contributor.authorJančar, Petr
dc.contributor.authorKučera, Antonín
dc.contributor.authorMayr, Richard
dc.identifier.citationTheoretical computer science. 2001, vol. 258, issues 1-2, p. 409-433.en
dc.relation.ispartofseriesTheoretical computer scienceen
dc.subjectcharacteristic formulaeen
dc.subjectinfinite-state systemsen
dc.titleDeciding bisimulation-like equivalences with finite-state processesen
dc.identifier.locationNení ve fondu ÚKen
dc.description.abstract-enWe show that characteristic formulae for finite-state systems up to bisimulation-like equivalences (e.g., strong and weak bismilarity) can be given in the simple branching-time temporal logic EF. Since EF is a very weak fragment of the modal mu -calculus, model checking with EF is decidable for many more classes of infinite state systems. This yields 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 pushdown (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. Oa 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

Files in this item


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 [2684]
    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