Graphical versus logical specifications
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
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
Modeling and Model Checking Software Product Lines
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Modal Abstractions of Concurrent Behaviour
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Why Are Modalities Good for Interface Theories?
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Dual-Priced modal transition systems with time durations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A modal specification theory for components with data
Science of Computer Programming
| Hi-index | 0.00 |
Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcome many of the limitations and we investigate the computational complexity of modal refinement checking.