Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
MTSA: Eclipse support for modal transition systems construction, analysis and elaboration
Proceedings of the 2007 OOPSLA workshop on eclipse technology eXchange
Modal Abstractions of Concurrent Behaviour
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Mixed Transition Systems Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Refinement and Consistency of Timed Modal Specifications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On determinism in modal transition systems
Theoretical Computer Science
MTSA: The Modal Transition System Analyser
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Why Are Modalities Good for Interface Theories?
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Modal and mixed specifications: Key decision problems and their complexities
Mathematical Structures in Computer Science
Complexity of decision problems for mixed and modal specifications
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
On weak modal compatibility, refinement, and the MIO workbench
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
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.