Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
An industrial application of modal process logic
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Journal of the ACM (JACM)
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Generality in design and compositional verification using TAV
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
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
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
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Refinement is complete for implementations
Formal Aspects of Computing
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
Residual for Component Specifications
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
YASM: a software model-checker for verification and refutation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Properties of behavioural model merging
FM'06 Proceedings of the 14th international conference on Formal Methods
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Decision problems for interval Markov chains
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
| Hi-index | 0.00 |
Modal and mixed transition systems are specification formalisms that allow the mixing of over-and under-approximation. We discuss three fundamental decision problems for such specifications: —whether a set of specifications has a common implementation;—whether an individual specification has an implementation; and—whether all implementations of an individual specification are implementations of another one. For each of these decision problems we investigate the worst-case computational complexity for the modal and mixed cases. We show that the first decision problem is EXPTIME-complete for both modal and mixed specifications. We prove that the second decision problem is EXPTIME-complete for mixed specifications (it is known to be trivial for modal ones). The third decision problem is also shown to be EXPTIME-complete for mixed specifications.