Deciding bisimilarity between BPA and BPP processes

DSpace/Manakin Repository

aaK citaci nebo jako odkaz na tento záznam použijte identifikátor: http://hdl.handle.net/10084/57358

Show simple item record


dc.contributor.author Jančar, Petr
dc.contributor.author Kučera, Antonín
dc.contributor.author Moller, Faron
dc.date.accessioned 2006-10-24T13:40:35Z
dc.date.available 2006-10-24T13:40:35Z
dc.date.issued 2003
dc.identifier.citation CONCUR 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.isbn 978-3-540-40753-9
dc.identifier.issn 0302-9743
dc.identifier.uri http://hdl.handle.net/10084/57358
dc.description.abstract We 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.iso en en
dc.publisher Springer en
dc.relation.ispartofseries CONCUR 2003 - Concurrency theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings en
dc.relation.uri http://dx.doi.org/10.1007/b11938 en
dc.title Deciding bisimilarity between BPA and BPP processes en
dc.type article en
dc.identifier.location Není ve fondu ÚK en
dc.identifier.doi 10.1007/b11938
dc.identifier.wos 000185948700010

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Navigation

Browse

My Account

Statistics