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
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
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
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The power of reachability testing for timed automata
Theoretical Computer Science
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
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Dating concurrent objects: real-time modeling and schedulability analysis
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
| Hi-index | 0.00 |
Concurrent objects encapsulate a processor each and communicate by asynchronous message passing; therefore, they can be composed to naturally model distributed and embedded systems. We model real-time concurrent objects using timed automata and provide each object with a context-specific scheduling policy. The envisioned usage and guaranteed deadlines of each object is specified in its behavioral interface, given also in timed automata. Furthermore, multiple objects can be composed only if they are compatible, i.e., if they respect the expected use patterns given in the behavioral interfaces of each other. In this paper, we define refinement of timed automata with inputs and outputs from a new perspective and we take account of deadlines in the refinement theory. Within this framework, we study composition and compatibility of real-time concurrent objects, and apply it in the context of compositional schedulability analysis of multiple-processor systems.