Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A context dependent equivalence between processes
Theoretical Computer Science
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
An industrial application of modal process logic
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
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
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Use of Static Constructs in A Modal Process Logic
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Weak Refinement for Modal Hybrid Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Timed Modal Specification - Theory and Tools
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
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
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Properties of behavioural model merging
FM'06 Proceedings of the 14th international conference on Formal Methods
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Refinement and Consistency of Timed Modal Specifications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
EXPTIME-complete Decision Problems for Modal and Mixed Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
On determinism in modal transition systems
Theoretical Computer Science
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
A Compositional Approach on Modal Specifications for Timed Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
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
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Electronic Notes in Theoretical Computer Science (ENTCS)
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
A modal interface theory with data constraints
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Parametric modal transition systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Incremental consistency checking of dynamic constraints
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
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
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
Unblockable compositions of software components
Proceedings of the 15th ACM SIGSOFT symposium on Component Based Software Engineering
Modal event-clock specifications for timed component-based design
Science of Computer Programming
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
Ensuring reachability by design
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
A formal framework for software product lines
Information and Software Technology
A modal specification theory for components with data
Science of Computer Programming
| Hi-index | 0.00 |
Almost 20 years after the original conception, we revisit several fundamental question about modal transition systems. First, we demonstrate the incompleteness of the standard modal refinement using a counterexmnple due to Huttel. Deciding any refinement, complete with respect to the standard notions of implementation, is shown to be computationally hard (co-NP hard). Second, we consider four forms of consistency (existence of implementations) ibr modal specifications. We characterize each operationally, giving algorithms for deciding, and for synthesizing implementations, together with their complexities.