The IF Toolset

This paper presents an overview on the IF toolset which is an environment for modelling and validation of heterogeneous real-time systems. The toolset is built upon a rich formalism, the IF notation, allowing structured automata-based system representations. Moreover, the IF notation is expressive enough to support real-time primitives and extensions of high-level modelling languages such as SDL and UML by means of structure preserving mappings. The core part of the IF toolset consists of a syntactic transformation component and an open exploration platform. The syntactic transformation component provides language level access to IF descriptions and has been used to implement static analysis and optimisation techniques. The exploration platform gives access to the graph of possible executions. It has been connected to different state-of-the-art model-checking and test-case generation tools. A methodology for the use of the toolset is presented at hand of a case study concerning the Ariane-5 flight program for which both an SDL and a UML model have been validated

[1]  Thierry Jéron,et al.  Test Generation Derived from Model-Checking , 1999, CAV.

[2]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[3]  Conrado Daws,et al.  Reducing the number of clock variables of timed automata , 1996, RTSS.

[4]  Amir Pnueli,et al.  Compositionality: The Significant Difference , 1999, Lecture Notes in Computer Science.

[5]  Thierry Jéron,et al.  Using On-The-Fly Verification Techniques for the Generation of test Suites , 1996, CAV.

[6]  Ahmed Bouajjani,et al.  TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.

[7]  Alexander L. Wolf,et al.  Software architecture , 2001 .

[8]  Joseph Sifakis,et al.  Scheduler Modeling Based on the Controller Synthesis Paradigm , 2002, Real-Time Systems.

[9]  Alan Hartman,et al.  The AGEDIS tools for model based testing , 2004, ISSTA '04.

[10]  David Harel,et al.  Modeling Reactive Systems With Statecharts : The Statemate Approach , 1998 .

[11]  Joseph Sifakis,et al.  Modeling Urgency in Timed Systems , 1997, COMPOS.

[12]  Amir Pnueli,et al.  Understanding UML: A Formal Semantics of Concurrency and Communication in Real-Time UML , 2002, FMCO.

[13]  Alain Kerbrat,et al.  Protocol verification with the ALDÉBARAN toolset , 1997, International Journal on Software Tools for Technology Transfer.

[14]  Axel Uhl,et al.  Model-Driven Architecture , 2002, OOIS Workshops.

[15]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[16]  Joseph Sifakis,et al.  IF: An intermediate representation for SDL and its applications , 1999, SDL Forum.

[17]  Joseph Sifakis,et al.  Use of Petri nets for performance evaluation , 1977, Acta Cybern..

[18]  Joseph Sifakis,et al.  Building models of real-time systems from application software , 2003, Proc. IEEE.

[19]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[20]  Joseph Sifakis,et al.  Safety for Branching Time Semantics , 1991, ICALP.

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

[22]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[23]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[24]  Joseph Sifakis,et al.  A Methodology for the Construction of Scheduled Systems , 2000, FTRTFT.

[25]  Yassine Lakhnech,et al.  Computing Abstractions of Infinite State Systems Compositionally and Automatically , 1998, CAV.

[26]  Joseph Sifakis,et al.  Modeling Real-Time Systems-Challenges and Work Directions , 2001, EMSOFT.

[27]  Joseph Sifakis,et al.  An Algebraic Framework for Urgency , 2000, Inf. Comput..

[28]  Frank Tip,et al.  A survey of program slicing techniques , 1994, J. Program. Lang..

[29]  Iulian Ober,et al.  Model checking of UML models via a mapping to communicating extended timed automata , 2003 .

[30]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[31]  Iulian Ober,et al.  Validation of UML Models via a Mapping to Communicating Extended Timed Automata , 2004, SPIN.

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

[33]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[34]  Jozef Hooman,et al.  A semantics of communicating reactive objects with timing , 2006, International Journal on Software Tools for Technology Transfer.

[35]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

[36]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[37]  Mark Weiser,et al.  Program Slicing , 1981, IEEE Transactions on Software Engineering.

[38]  Joseph Sifakis,et al.  Composition for component-based modeling , 2002, Sci. Comput. Program..

[39]  David Harel,et al.  LSCs: Breathing Life into Message Sequence Charts , 1999, Formal Methods Syst. Des..

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

[41]  Jozef Hooman,et al.  Correct Development of Embedded Systems , 2004 .