| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Kučera, Antonín | |
| dc.contributor.author | Mayr, Richard | |
| dc.date.accessioned | 2006-11-08T09:17:12Z | |
| dc.date.available | 2006-11-08T09:17:12Z | |
| dc.date.issued | 2001 | |
| dc.identifier.citation | Theoretical Computer Science. 2001, vol. 258, issues 1-2, p. 409-433. | en |
| dc.identifier.issn | 0304-3975 | |
| dc.identifier.uri | http://hdl.handle.net/10084/57925 | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.relation.ispartofseries | Theoretical Computer Science | en |
| dc.relation.uri | http://dx.doi.org/10.1016/S0304-3975(00)00027-X | en |
| dc.subject | concurrency | en |
| dc.subject | bisimulation | en |
| dc.subject | characteristic formulae | en |
| dc.subject | infinite-state systems | en |
| dc.title | Deciding bisimulation-like equivalences with finite-state processes | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.description.abstract-en | We 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 |
| dc.identifier.doi | 10.1016/S0304-3975(00)00027-X | |
| dc.identifier.wos | 000168502800010 | |