Name
Abstract | ||
|---|---|---|
Modal transition systems (MTS), a specification formalism introduced more than 20 years ago, has recently received a considerable attention in several different areas. Many of the fundamental questions related to MTSs have already been answered. However, the problem of the exact computational complexity of thorough refinement checking between two finite MTSs remained unsolved. We settle down this question by showing EXPTIME-completeness of thorough refinement checking on finite MTSs. The upper-bound result relies on a novel algorithm running in single exponential time providing a direct goal-oriented way to decide thorough refinement. If the right-hand side MTS is moreover deterministic, or has a fixed size, the running time of the algorithm becomes polynomial. The lower-bound proof is achieved by reduction from the acceptance problem of alternating linear bounded automata and the problem remains EXPTIME-hard even if the left-hand side MTS is fixed and deterministic. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ic.2012.08.001 | Inf. Comput. |
Keywords | Field | DocType |
right-hand side,modal transition system,single exponential time,acceptance problem,thorough refinement checking,thorough refinement,considerable attention,novel algorithm,left-hand side,finite mtss,fixed size,computational complexity,refinement,complexity | Discrete mathematics,Combinatorics,Exponential function,Polynomial,EXPTIME,Linear bounded automaton,Formalism (philosophy),Completeness (statistics),Mathematics,Modal,Computational complexity theory | Journal |
Volume | ISSN | Citations |
218, | 0890-5401 | 4 |
PageRank | References | Authors |
0.39 | 27 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Beneš | 1 | 42 | 3.58 |
| Jan Křetínský | 2 | 190 | 12.05 |
| Kim G. Larsen | 3 | 3922 | 254.03 |
| Jiří Srba | 4 | 629 | 31.24 |