Benes, Nikola6; Kretínsky, Jan7; Larsen, Kim Guldstrand1; Møller, Mikael Harkjær3; Sickert, Salomon8; Srba, Jiri3
1 CISS - Center for Embedded Software Systems, Department of Computer Science, The Technical Faculty of IT and Design, Aalborg University2 Distributed Systems and Semantics, Department of Computer Science, The Technical Faculty of IT and Design, Aalborg University3 Department of Computer Science, The Technical Faculty of IT and Design, Aalborg University4 Aalborg U Robotics, Department of Communication and Psychology, The Faculty of Humanities, Aalborg University5 The Faculty of Engineering and Science (TECH), Aalborg University6 FIMU7 Technical University München8 Technical University Munich (TUM)
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 overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS.
Acta Informatica, 2015, Vol 52, Issue 2, p. 269-297