Decidability of bisimilarity for one-counter processes

DSpace/Manakin Repository

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

Show simple item record


dc.contributor.author Jančar, Petr
dc.date.accessioned 2006-11-09T11:58:12Z
dc.date.available 2006-11-09T11:58:12Z
dc.date.issued 2000
dc.identifier.citation Information and computation. 2000, vol. 158, issue 1, p. 1-17 . en
dc.identifier.issn 0890-5401
dc.identifier.uri http://hdl.handle.net/10084/58004
dc.language.iso en en
dc.publisher Academic Press en
dc.relation.ispartofseries Information and computation en
dc.relation.uri http://dx.doi.org/10.1006/inco.1999.2813 en
dc.subject equivalence en
dc.title Decidability of bisimilarity for one-counter processes en
dc.type Article en
dc.identifier.location Není ve fondu ÚK en
dc.description.abstract-en It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata, where the pushdown behaves like a counter. Also finiteness up to bisimilarity is shown to be decidable for the mentioned processes. en
dc.identifier.doi 10.1006/inco.1999.2813
dc.identifier.wos 000086495000001

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

  • Publikační činnost VŠB-TUO / Publications of VŠB-TUO [1876]
    Kolekce obsahuje bibliografické záznamy publikační činnosti (článků) akademických pracovníků VŠB-TUO v časopisech (a v Lecture Notes in Computer Science) registrovaných ve Web of Science od roku 1990 po současnost.

Show simple item record

Search DSpace


Advanced Search

Navigation

Browse

My Account

Statistics