Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fischer's protocol revisited: a simple proof using modal constraints
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Timed Modal Specification - Theory and Tools
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A foundation for behavioural conformance in software product line architectures
Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
State explosion in almost-sure probabilistic reachability
Information Processing Letters
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
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
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
| Hi-index | 0.00 |
Modal and mixed transition systems are formalisms that allow mixing of over- and under-approximation in a single specification. We show EXPTIME-completeness of three fundamental decision problems for such specifications: whether a set of modal or mixed specifications has a common implementation, whether a sole mixed specification has an implementation, and whether all implementations of one mixed specification are implementations of another mixed or modal one. These results are obtained by a chain of reductions starting with the acceptance problem for linearly bounded alternating Turing machines.