Electronic Notes in Theoretical Computer Science (ENTCS)
Dating concurrent objects: real-time modeling and schedulability analysis
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
Modular schedulability analysis of concurrent objects in creol
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Composing real-time concurrent objects: refinement, compatibility and schedulability
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
We apply automata theory to specifying behavioralinterfaces of objects and show how to check schedulabilityand compatibility of real time asynchronous objects.The behavioral interfaces of real time objects specify(the order and timings of) the messages an object maysend and receive. Each object is checked against itsbehavioral interface; first, to guarantee its correct outputbehavior, and second to make sure that every messageit may receive is processed within the designateddeadline (schedulability analysis). Next, we propose anew technique for testing whether every object is usedas expected (i.e., according to its behavioral interface)when combined with other objects (compatibility check).Compatibility additionally implies schedulability in thecontext of the actual system. The analyses are automatedusing the Uppaal model checker.