Communication and concurrency
On the complexity of equation solving in process algebra
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
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
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
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
On the Complexity of Semantic Self-minimization
Electronic Notes in Theoretical Computer Science (ENTCS)
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
A Sound Observational Semantics for Modal Transition Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Modal and mixed specifications: Key decision problems and their complexities
Mathematical Structures in Computer Science
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
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
A modal specification theory for components with data
Science of Computer Programming
| Hi-index | 0.00 |
We consider decision problems for modal and mixed transition systems used as specifications: the common implementation problem (whether a set of specifications has a common implementation), the consistency problem (whether a single specification has an implementation), and the thorough refinement problem (whether all implementations of one specification are also implementations of another one). Common implementation and thorough refinement are shown to be PSPACE-hard for modal, and so also for mixed, specifications. Consistency is PSPACEhard for mixed, while trivial for modal specifications. We also supply upper bounds suggesting strong links between these problems.