Modal Transition Systems: Composition and LTL Model Checking

Investor logo
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

BENEŠ Nikola ČERNÁ Ivana KŘETÍNSKÝ Jan

Year of publication 2011
Type Article in Proceedings
Conference ATVA 2011 - Automated Technology for Verification and Analysis: 9th International Symposium
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords modal transition systems; model checking; refinement; conjunction
Attached files
Description Modal transition systems (MTS) is a~well established formalism used for specification and for abstract interpretation. We consider its disjunctive extension (DMTS) and we provide algorithms showing that refinement problems for DMTS are not harder than in the case of MTS. There are two main results in the paper. Firstly, we identify an error in a~previous attempt at LTL model checking of MTS and provide algorithms for LTL model checking of MTS and DMTS. Moreover, we show how to apply this result to compositional verification and circumvent the general incompleteness of the MTS composition. Secondly, we give a~solution to the common implementation and conjunctive composition problems lowering the complexity from EXPTIME to PTIME.
Related projects:

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