Modeling a Language for Embedded Systems in Timed Automata

We present a compositional method for translating real-time programs into networks of timed automata. Programs are written in an assembly like real-time language and translated into models supported by the tool Uppaal. We have implemented the translation and give an example of its application on a simple control program for a car. Some properties of the behavior of the control program are verified using the generated model.

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

[2]  Jirí Srba,et al.  Matching Modulo Associativity and Idempotency Is NP-Complete , 2000, MFCS.

[3]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[4]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[5]  Ulrich Kohlenbach,et al.  Effective Uniform Bounds on the Krasnoselski-Mann Iteration , 2000 .

[6]  Stefan Dantchev,et al.  A Tough Nut for Tree Resolution , 2000 .

[7]  Jirí Srba.  Complexity of Weak Bisimilarity and Regularity for BPA and BPP , 2000, EXPRESS.

[8]  Ulrich Kohlenbach.  Intuitionistic Choice and Restricted Classical Logic , 2001, Math. Log. Q..

[9]  Thomas A. Henzinger,et al.  A User Guide to HyTech , 1995, TACAS.

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

[11]  Nabil H. Mustafa,et al.  Democratic Consensus and the Local Majority Rule , 2000 .

[12]  Olivier Danvy,et al.  Syntactic accidents in program analysis: on the impact of the CPS transformation , 2000, ICFP '00.

[13]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[14]  R. Cramer,et al.  Multiparty Computation from Threshold Homomorphic Encryption , 2000 .