Nonprimitive recursive complexity and undecidability for Petri net equivalences

Show simple item record
dc.contributor.authorJančar, Petr
dc.date.accessioned2007-06-26T10:45:34Z
dc.date.available2007-06-26T10:45:34Z
dc.date.issued2001
dc.description.abstract-enThe aim of this note is twofold. Firstly, it shows that the undecidability result for bisimilarity in [Theor. Comput. Sci. 148 (1995) 281–301] can be immediately extended for the whole range of equivalences (and preorders) on labelled Petri nets. Secondly, it shows that restricting our attention to nets with finite reachable space, the respective (decidable) problems are nonprimitive recursive; this approach also applies to Mayr and Meyer's result [J. ACM 28 (1981) 561–576] for the reachability set equality, yielding a more direct proof.en
dc.identifier.citationTheoretical Computer Science. 2001, vol. 256, issues 1-2, p. 23-30.en
dc.identifier.doi10.1016/S0304-3975(00)00100-6
dc.identifier.issn0304-3975
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.urihttp://hdl.handle.net/10084/60741
dc.identifier.wos000167884300003
dc.language.isoenen
dc.publisherElsevieren
dc.relation.ispartofseriesTheoretical Computer Scienceen
dc.relation.urihttp://dx.doi.org/10.1016/S0304-3975(00)00100-6en
dc.subjectPetri-netsen
dc.subjectdecidabilityen
dc.subjectcomplexityen
dc.titleNonprimitive recursive complexity and undecidability for Petri net equivalencesen
dc.typearticleen

Files

Collections

Publikační činnost VŠB-TUO ve Web of Science / Publications of VŠB-TUO in Web of Science