Automatic Translation from UPPAAL to C

In this paper we propose a deterministic semantic simplification of a given real-time UPPAAL model. We then propose a translation from the simple model to an actual implementation written in C and we argue that the implementation is correct. This translation is implemented in the compiler tool uppaal2c, which generates implementations that run on hard real-time systems (RTLinux). Furthermore we show test results and benchmarks for a number of UPPAAL models.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[3]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[4]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[5]  Wang Yi,et al.  Code Synthesis for Timed Automata , 2003 .

[6]  Jean-François Raskin,et al.  Almost ASAP semantics: from timed models to timed implementations , 2004, Formal Aspects of Computing.