On Refinements of Boolean and Parametric Modal Transition Systems

  title={On Refinements of Boolean and Parametric Modal Transition Systems},
  author={Jan Křet{\'i}nsk{\'y} and Salomon Sickert},
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
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
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
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.
Modal transition system encoding of featured transition systems
This work establishes a rigorous connection between FTSs and Mtss by means of an encoding of one FTS into an equivalent set of multiple MTSs, and proves the encoding to be semantic-preserving and to commute with modal refinement.


Parametric Modal Transition Systems
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
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.
EXPTIME-completeness of thorough refinement on modal transition systems
This work settles down the problem of the exact computational complexity of thorough refinement checking between two finite MTSs by showing EXPTIME-completeness oforough refinement checking on finite M TSs.
On determinism in modal transition systems
A comprehensive account of the MTS framework in the deterministic setting is provided and a number of problems previously considered on MTS are studied and pointed out to what extend the authors can expect better results under the restriction of determinism.
Abstraction-Based Model Checking Using Modal Transition Systems
A framework for automatic program abstraction that can be used for model checking any formula of the modal mu-calculus, which can both prove and disprove any formula including arbitrarily nested path quantifiers is presented.
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
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.
Comparing disjunctive modal transition systems with an one-selecting variant
A variant of DMTSs is developed called 1-selecting modal transition systems (OMTS) that, roughly speaking, interprets hypertransitions exclusively (XOR), and it is shown that the two setting can express the same sets of labeled transition systems, but 1- selecting modal Transition systems have a richer refinement preorder.
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
A new operation of quotient is introduced, which is adjoint to structural composition and allows synthesis of missing specifications from partial implementations and is a substantial generalisation of the quotient for deterministic modal transition systems defined in earlier papers.
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
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
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.