KŘETÍNSKÝ, Jan and Salomon SICKERT. On Refinements of Boolean and Parametric Modal Transition Systems. In Z. Liu, J. Woodcock, and H. Zhu. Theoretical Aspects of Computing - ICTAC 2013 - 10th International Colloquium. Heidelberg Dordrecht London New York: Springer, 2013, p. 213-230. ISBN 978-3-642-39717-2. Available from: https://dx.doi.org/10.1007/978-3-642-39718-9_13.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name On Refinements of Boolean and Parametric Modal Transition Systems
Authors KŘETÍNSKÝ, Jan (203 Czech Republic, guarantor, belonging to the institution) and Salomon SICKERT (276 Germany).
Edition Heidelberg Dordrecht London New York, Theoretical Aspects of Computing - ICTAC 2013 - 10th International Colloquium, p. 213-230, 18 pp. 2013.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/13:00066200
Organization unit Faculty of Informatics
ISBN 978-3-642-39717-2
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-642-39718-9_13
Keywords (in Czech) modal transition systems; refinement
Keywords in English modal transition systems; specification; interface theory; refinement
Tags firank_B
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 27/4/2014 23:18.
Abstract
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.
Links
GAP202/10/1469, research and development projectName: Formální metody pro analýzu a verifikaci komplexních systémů
Investor: Czech Science Foundation
MUNI/A/0760/2012, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II. (Acronym: FI MAV II.)
Investor: Masaryk University, Category A
PrintDisplayed: 8/5/2024 11:07