Zobrazit minimální záznam

dc.contributor.authorJančar, Petr
dc.contributor.authorKučera, Antonín
dc.contributor.authorMoller, Faron
dc.contributor.authorSawa, Zdeněk
dc.date.accessioned2006-10-31T09:52:19Z
dc.date.available2006-10-31T09:52:19Z
dc.date.issued2002
dc.identifier.citationFoundations of software science and computation structures : 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002. Proceedings. 2002, p. 172-186.en
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10084/57568
dc.description.abstractWe present a general method for proving DP-hardness of equivalence-checking problems on one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter automata. In this way we show that the membership problem for any relation subsuming bisimilarity and subsumed by simulation preorder is DP-hard (even) for one-counter nets (where the counter cannot be tested for zero). We also show DP-hardness for deciding simulation between one-counter automata and finite-state systems (in both directions).en
dc.language.isoenen
dc.publisherSpringeren
dc.relation.ispartofseriesFoundations of software science and computation structures : 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002. Proceedingsen
dc.relation.urihttp://dx.doi.org/10.1007/3-540-45931-6_13en
dc.titleEquivalence-checking with one-counter automata: A generic method for proving lower boundsen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1007/3-540-45931-6_13
dc.identifier.wos000181142100013


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