| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Kučera, Antonín | |
| dc.contributor.author | Mayr, Richard | |
| dc.date.accessioned | 2007-09-18T07:01:49Z | |
| dc.date.available | 2007-09-18T07:01:49Z | |
| dc.date.issued | 1998 | |
| dc.identifier.citation | Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998. Proceedings. 1998, p. 200-211. | en |
| dc.identifier.isbn | 978-3-540-64781-2 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/10084/62798 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/BFb0055035 | 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 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.doi | 10.1007/BFb0055035 | |
| dc.identifier.wos | 000082774400018 | |