Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using UPPAAL, a model checker for networks of timed automata. We show how to translate schedulability to reachability, enabling us to use UPPAAL’s model checking algorithms.

This paper studies the structural complexity of model checking for (variations on) the speci cation formalisms used in the tools CMC and Uppaal, and fragments of a timed alternation-free μ-calculus. For each of the logics we study, we characterize the computational complexity of model checking, as well as its speci cation and program complexity, using timed automata as our system model.

Timed nite automata, introduced by Alur and Dill, are one of the most widely studied models for real-time systems. We focus in this paper on the practical issue of veriication for such systems. More precisely , we investigate the comparative performances of three well known veriication tools : HyTech, Kronos and Uppaal.

In this paper we present a tool ((Me) for compositional modelchecking of real-time systems. (M( is based on a completely different method compared to existing real-time verification tools (HYTECH, KRONOS, UPPAAL). After a description of the method, we illustrate its efficiency by considering two examples : the Fischer's mutual exclusion protocol and a railroad crossing system.

Gerd Behrmann, Kim G. Larsen Basi Resear h in Computer S ien e, Aalborg University, Denmark Oliver M oller Basi Resear h in Computer S ien e, Aarhus University, Denmark Alexandre David, Paul Pettersson, Wang Yi Department of Information Te hnology, Uppsala University, Sweden Abstra t Uppaal is a tool for modelling, simulation and veri ation of real-time systems, developed jointly by BRICS at A...

Formal methods have been applied frequently to analyze (critical parts of) standards for communication protocols and it has been demonstrated that their application may help to improve the quality of these standards. Nevertheless, despite several decades of formal methods research, formal methods notations have rarely been included in the authoritative part of protocol standards. Also, the rela...

Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are “consistent” with those provided in a timed MSC specification. In general, the specification may be both positive and negative. The system should execute all positive scenarios “sensibly”. On the other hand, negative scenarios rule out ...

Flexible temporal planning is a general technique that has demonstrated wide applications possibilities in heterogeneous domains. A key problem for widening applicability of these techniques is the robust connection between plan generation and execution. This paper describes how a model-checking verification tool, based on UPPAAL-TIGA, is suitable for verifying flexible temporal plans. Moreover...

We present a detailled timed automata model of the clock synchronization algorithm that is currently being used in a wireless sensor network (WSN) that has been developed by the Dutch company Chess. Using the UPPAAL model checker, we establish that in certain cases a static, fully synchronized network may eventually become unsynchronized if the current algorithm is used, even in a setting with ...

In this article we show a way to model and verify programs running on LEGO RCX bricks using the tool UPPAAL. We are able to model two RCX units communicating through an infrared channel. To facilitate the distribution of programs on the two RCXes, we develop the “IR Protocol”, which allows both RCXes to read and write variables and I/O ports on the other RCX. The protocol makes use of a simplif...