On refinements of Boolean and parametric modal transition systems
From MaRDI portal
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.
Recommendations
Cited in
(11)- A refinement repair algorithm based on refinement game for KMTS models
- Refinement checking on parametric modal transition systems
- Modal transition system encoding of featured transition systems
- Refinement is complete for implementations
- Topological analysis of refinement
- An inductive approach for modal transition system refinement
- Parametric modal transition systems
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- On Modal Refinement and Consistency
- Coherent modal transition systems refinement
- EXPTIME-completeness of thorough refinement on modal transition systems
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)