OMEGA Correct Development of Real Time Systems

This document gathers all the notations defined in OMEGA. As OMEGA is defined based on UML we do not describe here all UML specific notations, instead we give the differences to the official standard (reference version UML 1.4). The introduction briefly describes how various notations fit together. Note : This document was updated during the 5 th period to reflect changes in the OMEGA action language and the definition of UML observers.

[1]  Edmund M. Clarke,et al.  Efficient generation of counterexamples and witnesses in symbolic model checking , 1995, DAC '95.

[2]  Madhavan Mukund,et al.  On Message Sequence Graphs and Finitely Generated Regular MSC Languages , 2000, ICALP.

[3]  David Harel,et al.  Playing with time: on the specification and execution of time-enriched LSCs , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[4]  J. Richard Büchi State-Strategies for Games in F G , 1983, J. Symb. Log..

[5]  David Harel,et al.  Executable object modeling with statecharts , 1997, Computer.

[6]  Theo C. Ruys,et al.  Optimal Scheduling Using Branch and Bound with SPIN 4.0 , 2003, SPIN.

[7]  Anthony Massa,et al.  Embedded Software Development with eCos , 2002 .

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

[9]  David Harel,et al.  Synthesizing State-Based Object Systems from LSC Specifications , 2000, Int. J. Found. Comput. Sci..

[10]  Jochen Klose,et al.  An Automata Based Interpretation of Live Sequence Charts , 2001, TACAS.

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

[12]  David Harel,et al.  On the behavioral inheritance of state-based objects , 2000, Proceedings. 34th International Conference on Technology of Object-Oriented Languages and Systems - TOOLS 34.

[13]  Iulian Ober,et al.  Validating timed UML models by simulation and verification , 2006, International Journal on Software Tools for Technology Transfer.

[14]  Erkki Mäkinen,et al.  Automatic synthesis of state machines from trace diagrams , 1994, Softw. Pract. Exp..

[15]  Gerhard Fohler,et al.  Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[16]  Alan W. Biermann,et al.  Constructing Programs from Example Computations , 1976, IEEE Transactions on Software Engineering.

[17]  David Harel,et al.  Multiple instances and symbolic variables in executable sequence charts , 2002, OOPSLA '02.

[18]  Rajeev Alur,et al.  Model Checking of Message Sequence Charts , 1999, CONCUR.

[19]  David Harel,et al.  Come, let's play - scenario-based programming using LSCs and the play-engine , 2003 .

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

[21]  Daniel Amyot,et al.  An Evaluation of Scenario Notations for Telecommunication Systems Development , 2001 .

[22]  Thomas A. Henzinger,et al.  Real-time system = discrete system + clock variables , 1994, International Journal on Software Tools for Technology Transfer.

[23]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[24]  Amir Pnueli,et al.  Formal Modeling of C. elegans Development: A Scenario-Based Approach , 2003, CMSB.

[25]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[26]  David Harel,et al.  InterPlay: Horizontal Scale-Up and Transition to Design in Scenario-Based Programming , 2006, IEEE Trans. Software Eng..

[27]  Anca Muscholl,et al.  Deciding Properties for Message Sequence Charts , 1998, FoSSaCS.

[28]  Madhavan Mukund,et al.  Regular Collections of Message Sequence Charts , 2000, MFCS.

[29]  Manfred Broy,et al.  From MSCs to Statecharts , 1998, DIPES.

[30]  Anca Muscholl,et al.  Compositional Message Sequence Charts , 2001, TACAS.

[31]  Amir Pnueli,et al.  Smart Play-out of Behavioral Requirements , 2002, FMCAD.

[32]  Frank S. de Boer A proof rule for process-creation , 1987, Formal Description of Programming Concepts.

[33]  Johan Lilius,et al.  Formalising UML State Machines for Model Checking , 1999, UML.

[34]  Rajeev Alur,et al.  An Analyser for Mesage Sequence Charts , 1996, TACAS.

[35]  David Harel,et al.  Specifying and executing behavioral requirements: the play-in/play-out approach , 2003, Software & Systems Modeling.

[36]  David Harel,et al.  Combining State-Based and Scenario-Based Approaches in Modeling Biological Systems , 2004, CMSB.

[37]  Johann Schumann,et al.  Generating statechart designs from scenarios , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[38]  Jochen Klose,et al.  Scenario-Based Monitoring and Testing of Real-Time UML Models , 2001, UML.

[39]  Ingolf Krüger,et al.  Distributed system design with message sequence charts , 2000 .

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

[41]  Martín Abadi,et al.  An old-fashioned recipe for real time , 1994, TOPL.

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

[43]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[44]  Stefan Leue,et al.  Synthesizing ROOM Models from Message Sequence Chart Specifications , 1998 .