On Refinements of Boolean and Parametric Modal Transition Systems

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

KŘETÍNSKÝ Jan SICKERT Salomon

Year of publication 2013
Type Article in Proceedings
Conference Theoretical Aspects of Computing - ICTAC 2013 - 10th International Colloquium
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/978-3-642-39718-9_13
Field Informatics
Keywords modal transition systems; specification; interface theory; refinement
Description 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 investigate the relationship between modal and thorough refinement on the two classes and show how the thorough refinement can be approximated by the modal refinement.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.