Zobrazit minimální záznam

dc.contributor.authorSawa, Zdeněk
dc.contributor.authorJančar, Petr
dc.date.accessioned2009-05-04T10:24:52Z
dc.date.available2009-05-04T10:24:52Z
dc.date.issued2009
dc.identifier.citationActa informatica. 2009, vol. 46, no. 3, p. 169-191.en
dc.identifier.issn0001-5903
dc.identifier.issn1432-0525
dc.identifier.urihttp://hdl.handle.net/10084/71281
dc.description.abstractComputational complexity of comparing behaviours of systems composed from interacting finite-state components is considered. The main result shows that the respective problems are EXPTIME-hard for all relations between bisimulation equivalence and trace preorder, as conjectured by Rabinovich (Inf Comput 139(2):111–129, 1997). The result is proved for a specific model of parallel compositions where the components synchronize on shared actions but it can be easily extended to other similar models, to labelled 1-safe Petri nets. Further hardness results are shown for special cases of acyclic systems.en
dc.language.isoenen
dc.publisherSpringeren
dc.relation.ispartofseriesActa Informaticaen
dc.relation.urihttp://dx.doi.org/10.1007/s00236-008-0088-xen
dc.titleHardness of equivalence checking for composed finite-state systemsen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1007/s00236-008-0088-x
dc.identifier.wos000265216000001


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam