DP lower bounds for equivalence-checking and model-checking of one-counter automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F04%3A00010316" target="_blank" >RIV/61989100:27240/04:00010316 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/04:00009891
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Original language description
We present a general method for proving DP-hardness of problems related to formal verification of one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic
Czech name
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Czech description
We present a general method for proving DP-hardness of problems related to formal verification of one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information and Computation
ISSN
0890-5401
e-ISSN
—
Volume of the periodical
Neuveden
Issue of the periodical within the volume
188
Country of publishing house
BE - BELGIUM
Number of pages
20
Pages from-to
1-19
UT code for WoS article
—
EID of the result in the Scopus database
—