On Refinements of Boolean and Parametric Modal Transition Systems

@inproceedings{Ketnsk2013OnRO,
  title={On Refinements of Boolean and Parametric Modal Transition Systems},
  author={Jan Křet{\'i}nsk{\'y} and Salomon Sickert},
  booktitle={ICTAC},
  year={2013}
}
We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes. Firstly, we reduce the problem of modal refinement over both classes to a problem solvable by a QBF solver and provide experimental results showing our technique scales well. Secondly, we extend the algorithm for thorough refinement of MTS providing better complexity than via reductions to previously studied problems. Finally, we… 
Refinement checking on parametric modal transition systems
TLDR
A new model called parametric modal transition systems (PMTS) is introduced together with a general modal refinement notion that overcomes many of the limitations of this well-studied specification formalism of reactive systems.
30 Years of Modal Transition Systems: Survey of Extensions and Analysis
TLDR
The specification formalism of modal transition systems (MTS) is surveyed, various extensions of MTS, their relationships and modelling capabilities are discussed, and problems arising in verification and analysis of these systems are discussed.
MoTraS: A Tool for Modal Transition Systems and Their Extensions
TLDR
A tool for modal transition systems (MTS), disjunctive MTS and further extensions of MTS supporting also non-deterministic systems and some additional support such as deterministic hull, LTL model checking etc.

References

SHOWING 1-10 OF 37 REFERENCES
Parametric Modal Transition Systems
TLDR
A new model called parametric modal transition systems (PMTS) is introduced together with a general modal refinement notion that overcome many of the limitations of MTS and the computational complexity ofmodal refinement checking is investigated.
Modal Transition Systems: Composition and LTL Model Checking
TLDR
An error in a previous attempt at LTL model checking of MTS is identified and an algorithm is provided to apply this result to compositional verification and circumvent the general incompleteness of the MTS composition.
Disjunctive Modal Transition Systems and Generalized LTL Model Checking
TLDR
A solution to the common implementation and specification problems lowering the complexity from EXPTIME to PTIME is given and how to apply this result to compositional verification and circumvent the general incompleteness of the MTS composition is shown.
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
TLDR
Two major applications, model checking partial state spaces and three-valued program shape analysis, are presented as evidence of the suitability of Kripke MTSs as a foundation for three- valued analyses.
The existence of finite abstractions for branching time model checking
  • D. Dams, K. Namjoshi
  • Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
TLDR
This paper begins by showing that existing abstraction frameworks are inherently incomplete for verifying purely existential or mixed universal-existential properties, and proposes a new, complete abstraction framework which is based on a class of focused transition systems (FTS's).
Abstraction for Branching Time Properties
TLDR
This paper abstracts an alternating transition system (ATS) formed by the product of a program with an alternating tree automaton for a property, and shows semantic completeness: i.e., whenever a program satisfies aproperty, this can be shown using a finite-state abstract ATS produced by the method.
Interface automata
TLDR
This work presents a light-weight formalism that captures the temporal aspects of software component interfaces through an automata-based language that supports automatic compatability checks between interface models, and thus constitutes a type system for component interaction.
20 Years of Modal and Mixed Specifications
TLDR
The nature and utility of modal and mixed specifications are explained, relate them to other formalisms, showcase some of their established applications, and mention some existing tool support.
...
...