Constructing Test Automata from Graphical Real-Time Requirements

Abstract

A semantics for a graphical specification language of realtime properties (Constraint Diagrams) is presented. The new semantics is given in terms of Timed Automata. A model in terms of Timed Automata satisfies the property given by a Constraint Diagram if the model in parallel composition with the semantics of the Constraint Diagram can reach a certain state. This kind of question can be checked by all model-checkers for Timed Automata. A prototype of a tool is presented that automatically translates an appropriate Constraint Diagram into the input language of the tool Uppaal.

Model-Checking of Specifications Integrating Processes, Data and Time

“…In this paper, we confine ourselves to the verification of state invariants, i. e., to checking whether a set of unsafe states (violating the invariant) is reachable from the initial states. It is well known that this implies the ability to verify arbitrary safety properties by augmenting the system with suitable monitors or test-automata [7]. For verification, we decided to use the constraint-based model checker ARMC [19], because its constraint solver can handle linear arithmetic over the reals, which is crucial for our approach to real-time.…”

“…We would like to use the technique of test-automata [7] to reduce model-checking of DC-formulae to reachability. In this approach a parallel automaton checks the formula and reaches a certain state if the formula is violated.…”

Model checking Duration Calculus: a practical approach

“…With this observation our class forms a proper superset of { ϕ , < k, k, > k}-formulae that have exactly one outermost negation [Frä04]. We conjecture that the classes of constraint diagrams used for model checking timed automata in [DL02] form proper subsets of Testform. We have not yet compared the expressiveness of our class with the results in [ABBL03].…”