On Refinements of Boolean and Parametric Modal Transition Systems

DOI10.1007/978-3-642-39718-9_13zbMATH Open1405.68185arXiv1304.5278OpenAlexW2120347988MaRDI QIDQ2851908FDOQ2851908

Jan Křetínský, Salomon Sickert

Publication date: 4 October 2013

Published in: Theoretical Aspects of Computing – ICTAC 2013 (Search for Journal in Brave)

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 then 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.

Full work available at URL: https://arxiv.org/abs/1304.5278

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (5)

• EXPTIME-completeness of thorough refinement on modal transition systems
• Refinement checking on parametric modal transition systems
• Coherent modal transition systems refinement
• Modal transition system encoding of featured transition systems
• An inductive approach for modal transition system refinement

Uses Software

• JML
• MIO Workbench

This page was built for publication: On Refinements of Boolean and Parametric Modal Transition Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851908)