Eiffel: the language
Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Theoretical Computer Science
Information and Computation - Special issue on FLOC '96
Schedulability analysis of real time actor systems using coloured petri nets
Concurrent object-oriented programming and petri nets
TAXYS: A Tool for the Development and Verification of Real-Time Embedded Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Task automata: Schedulability, decidability and undecidability
Information and Computation
Schedulability and Compatibility of Real Time Asynchronous Objects
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Schedulability analysis of distributed hard real-time systems with multiple-event synchronization
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Type-Safe runtime class upgrades in creol
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
From nonpreemptive to preemptive scheduling: from single-processor to multi-processor?
Proceedings of the 2011 ACM Symposium on Applied Computing
Ten years of analyzing actors: Rebeca experience
Formal modeling
Timed-rebeca schedulability and deadlock-freedom analysis using floating-time transition system
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
| Hi-index | 0.00 |
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.