Timed Automata Semantics for Analyzing Creol

Jaghoori, Mohammad Mahdi; Chothia, Tom

doi:10.4204/eptcs.30.8

Cited by 6 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this way we avoid the explicit construction of a global automaton. This idea in spirit resembles the approaches of [19,38], which aim at smart play-out and satisfiability checking, respectively; and it is also similar to the approaches of mapping message-based concurrent objects to TAs [22,23], by means of which modular schedulability analysis of distributed real-time systems can be achieved. Thanks to the UPPAAL features of broadcast channels, boolean and integer variables and committed locations in timed automata, we are able to appropriately translate the LSC features such as intra/inter-chart coordinations and cold/hot violations to timed automata.…”

Section: Motivationmentioning

confidence: 95%

Scenario-based verification of real-time systems using Uppaal

Li¹,

Balaguer²,

David³

et al. 2010

Form Methods Syst Des

View full text Add to dashboard Cite

This article proposes two approaches to tool-supported automatic verification of dense real-time systems against scenario-based requirements, where a system is modeled as a network of timed automata (TAs) or as a set of driving live sequence charts (LSCs), and a requirement is specified as a separate monitored LSC chart.We make timed extensions to a kernel subset of the LSC language and define a tracebased semantics. By translating a monitored LSC chart to a behavior-equivalent observer TA and then non-intrusively composing this observer with the original TA-modeled realtime system, the problems of scenario-based verification reduce to computation tree logic (CTL) real-time model checking problems. When the real-time system is modeled as a set of driving LSC charts, we translate these driving charts and the monitored chart into a behaviorequivalent network of TAs by using a "one-TA-per-instance line" approach, and then reduce the problems of scenario-based verification also to CTL real-time model checking problems. We show how we exploit the expressivity of the TA formalism and the CTL query language Form Methods Syst Des (2010) 37: 200-264 201 of the real-time model checker UPPAAL to accomplish these tasks. The proposed two approaches are implemented in the UPPAAL tool and built as a tool chain, respectively. We carry out a number of experiments with both verification approaches, and the results indicate that these methods are viable, computationally feasible, and the tools are effective.

show abstract

Section: Motivationmentioning

confidence: 95%