On Refinements of Boolean and Parametric Modal Transition Systems

Varování

Publikace nespadá pod Pedagogickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.

Autoři	KŘETÍNSKÝ Jan SICKERT Salomon
Rok publikování	2013
Druh	Článek ve sborníku
Konference	Theoretical Aspects of Computing - ICTAC 2013 - 10th International Colloquium
Fakulta / Pracoviště MU	Fakulta informatiky
Citace
Doi	http://dx.doi.org/10.1007/978-3-642-39718-9_13
Obor	Informatika
Klíčová slova	modal transition systems; specification; interface theory; refinement
Popis	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.
Související projekty:	Formální metody pro analýzu a verifikaci komplexních systémů Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II.