Refinement and Consistency of Timed Modal Specifications

A Compositional Approach on Modal Specifications for Timed Systems

“…In this section we recall the framework of modal specifications defined in [17], further studied in [22], and its timed extension, recently proposed in [8]: We discuss the semantic, the preorder refinement and the satisfiability problem for untimed and timed modal specifications.…”

“…Building good interface theories is the subject of intensive studies which have led to theories based on models such as interface automata [11,13], modal automata or specifications [18,21,22,23,5], and their respective timed extension [12,8]. Modal specifications are deterministic automata equipped with transitions of the following two types: may and must .…”

“…Recently, a timed extension of the theory of modal specifications has been introduced [8], motivated by the fact that time can be a crucial parameter in practice, e.g. in embedded-system applications.…”

“…Inheriting from the region-based semantics of timed modal specifications [8], we study the satisfiability as well as the consistency problems for mecs. Satisfiability is PSPACE-complete, hence no harder than traditional decision problems in the class of timed automata.…”

Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

“…The MTS framework was suggested more than 20 years ago by Larsen and Thomsen [15] and has recently brought a considerable attention due to several applications to e.g. componentbased software development [17,6], interface theories [21,18], modal abstractions and program analysis [10,13,16] and other areas [9,22], just to mention a few of them. A renewed interest in tool support for modal transition systems is recently also emerging [7,8].…”