| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Kučera, Antonín | |
| dc.contributor.author | Moller, Faron | |
| dc.contributor.author | Sawa, Zdeněk | |
| dc.date.accessioned | 2006-10-13T13:02:50Z | |
| dc.date.available | 2006-10-13T13:02:50Z | |
| dc.date.issued | 2004 | |
| dc.identifier.citation | Information and Computation. 2004, vol. 188, issue 1, p. 1-19. | en |
| dc.identifier.issn | 0890-5401 | |
| dc.identifier.uri | http://hdl.handle.net/10084/57116 | |
| dc.description.abstract | 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 S-U 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), and for the model-checking problem with one-counter nets and the branching-time temporal logic EF. | en |
| 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.1016/S0890-5401(03)00171-8 | en |
| dc.subject | one-counter machines | en |
| dc.subject | equivalence-checking | en |
| dc.subject | model-checking | en |
| dc.title | DP lower bounds for equivalence-checking and model-checking of one-counter automata | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1016/S0890-5401(03)00171-8 | |
| dc.identifier.wos | 000187574200001 | |