Show simple item record

dc.contributor.authorJančar, Petr
dc.contributor.authorKučera, Antonín
dc.contributor.authorMoller, Faron
dc.date.accessioned2006-10-24T13:40:35Z
dc.date.available2006-10-24T13:40:35Z
dc.date.issued2003
dc.identifier.citationCONCUR 2003 - Concurrency theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. 2003, p. 159-173. Lecture notes in computer science, vol. 2761.en
dc.identifier.isbn978-3-540-40753-9
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10084/57358
dc.description.abstractWe identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective procedure for testing if this condition holds of a given BPP, and in the positive case we provide an effective construction for a particular form of one-counter automaton which is bisimilar to the given BPP. This in turn provides the mechanism to decide bisimilarity between a given BPP process and a given BPA process.en
dc.language.isoenen
dc.publisherSpringeren
dc.relation.ispartofseriesCONCUR 2003 - Concurrency theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedingsen
dc.relation.urihttp://dx.doi.org/10.1007/b11938en
dc.titleDeciding bisimilarity between BPA and BPP processesen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1007/b11938
dc.identifier.wos000185948700010


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record