| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Moller, Faron | |
| dc.date.accessioned | 2007-08-14T07:22:45Z | |
| dc.date.available | 2007-08-14T07:22:45Z | |
| dc.date.issued | 1999 | |
| dc.identifier.citation | CONCUR'99 - Concurrency Theory : 14th International Conference, Eindhoven, The Netherlands, August 1999. Proceedings. 1999, p. 30-45. | en |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/10084/61805 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | CONCUR'99 - Concurrency Theory : 14th International Conference, Eindhoven, The Netherlands, August 1999. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/3-540-48320-9_5 | en |
| dc.title | Techniques for decidability and undecidability of bisimilarity | en |
| dc.type | article | en |
| dc.identifier.location | Ve fondu ÚK | en |
| dc.description.abstract-en | In this tutorial we describe general approaches to deciding bisimilarity between vertices of (infinite) directed edge-labelled graphs. The approaches are based on a systematic search following the definition of bisimilarity. We outline (in decreasing levels of detail) how the search is modified to solve the problem for finite graphs, BPP graphs, BPA graphs, normed PA graphs, and normed PDA graphs. We complete this by showing the technique used in the case of graphs generated by one-counter machines. Finally, we demonstrate a general reduction strategy for proving undecidability, which we apply in the case of graphs generated by state-extended BPP (a restricted form of labelled Petri nets). | en |
| dc.identifier.doi | 10.1007/3-540-48320-9_5 | |
| dc.identifier.wos | 000087625300005 | |