A semantic-preserving transformation from the compositional interchange format to UPPAAL

Abstract The Compositional Interchange Format (CIF), is a modeling formalism for hybrid systems, that aims to establishing interoperability of a wide range of tools by means of model transformations to and from CIF. UPPAAL is a very successful tool for the specification and analysis of timed systems. It is interesting, both from a theoretical and a practical perspective, to be able to translate CIF models to UPPAAL models, since this makes it possible to model check properties of timed CIF models. This requires a semantic preserving transformation, which ensures that properties validated in UPPAAL models also hold for their CIF counterparts. In addition, by providing such a translation we are, at the same time, providing translations for a wider set of languages that can be transformed to CIF. This paper presents a semantic-preserving transformation from a subset of CIF models to UPPAAL. The transformation described in this work constitutes the cornerstone for transformations of a broader subset of CIF.

[1]  Harsh Beohar,et al.  Hierarchical states in the Compositional Interchange Format , 2010, SOS.

[2]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

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

[4]  Nancy A. Lynch,et al.  Hybrid I/O Automata Revisited , 2001, HSCC.

[5]  Michel A. Reniers,et al.  Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions , 2008, HSCC.

[6]  S. Lafortune.  Supervisory Control Of Discrete Event Systems , 2011 .

[7]  E. R. Caianiello.  STRUCTURE AND HIERARCHY , 1993 .

[8]  Rodolfo Gómez.  A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata , 2009, FORMATS.

[9]  Goran Frehse,et al.  Compositional verification of hybrid systems using simulation relations , 2005 .

[10]  Walter Murray Wonham,et al.  Nonblocking supervisory control of state tree structures , 2005, IEEE Transactions on Automatic Control.

[11]  M. Oliver,et al.  Structure and Hierarchy in Real-Time Systems , 2002 .

[12]  Ramon R. H. Schiffelers,et al.  New Concepts in the Abstract Format of the Compositional Interchange Format , 2009, ADHS.

[13]  J. M. van de Mortel-Fronczak,et al.  Verification of timed chi models using uppaal , 2005, ICINCO.

[14]  Jan Friso Groote,et al.  Notions of bisimulation and congruence formats for SOS with data , 2005, Inf. Comput..

[15]  D. A. van Beek,et al.  Concrete syntax and semantics of the compositional interchange format for hybrid systems , 2008 .

[16]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[17]  Jasen Markovski,et al.  Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting , 2010, FORMATS.