Modular Schedulability Analysis of Concurrent Objects in Creol

We present an automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol. In previous work we analyzed the schedulability of objects modeled as Timed Automata. In this paper, we extend this framework to support enabling conditions for methods and replies to messages and we extend the Creol language to allow the specification of real time information. We provide an algorithm for automatically translating Creol code annotated with this real time information to timed automata. This translation handles synchronization mechanisms in Creol, as well as processor release points. With this translation algorithm, we can analyze end-to-end deadlines, i.e., the deadline on the time since a message is sent until a reply is received.

[1]  R. Jakobson.  On Language , 1990 .

[2]  Bertrand Meyer,et al.  Eiffel: The Language , 1991 .

[3]  Christos Kloukinas,et al.  Synthesis of safe, QoS extendible, application specific schedulers for heterogeneous real-time systems , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[4]  Einar Broch Johnsen,et al.  Type-Safe Runtime Class Upgrades in Creol , 2006, FMOODS.

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

[6]  Wang Yi,et al.  Task automata: Schedulability, decidability and undecidability , 2007, Inf. Comput..

[7]  Einar Broch Johnsen,et al.  An Asynchronous Communication Model for Distributed Concurrent Objects , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[8]  J. Javier Gutiérrez,et al.  Schedulability analysis of distributed hard real-time systems with multiple-event synchronization , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

[9]  Mihalis Yannakakis,et al.  Minimum and maximum delay problems in real-time systems , 1991, Formal Methods Syst. Des..

[10]  Frank S. de Boer,et al.  Schedulability of asynchronous real-time concurrent objects , 2009, J. Log. Algebraic Methods Program..

[11]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[12]  Libero Nigro,et al.  Schedulability Analysis of Real Time Actor Systems Using Coloured Petri Nets , 2001, Concurrent Object-Oriented Programming and Petri Nets.

[13]  Frank S. de Boer,et al.  Schedulability and Compatibility of Real Time Asynchronous Objects , 2008, 2008 Real-Time Systems Symposium.

[14]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[15]  Michel Poize,et al.  TAXYS: A Tool for the Development and Verification of Real-Time Embedded Systems , 2001, CAV.

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