You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact

Opaque Analysis for Resource Sharing in Compositional Real-Time Systems


Martijn van den Heuvel , Moris Behnam, Reinder J. Bril, Johan Lukkien , Thomas Nolte

Publication Type:

Conference/Workshop Paper


4th Workshop on CRTS


In this paper we propose opaque analysis methods to integrate dependent real-time components into hierarchical fixed-priority scheduled systems. To arbitrate mutually exclusive resource access between components, we consider two existing protocols: HSRP - comprising overrun with and without payback - and SIRAP. An opaque analysis allows to postpone the choice of a synchronization protocol until component integration time. First, we identify the sources of pessimism in the existing analysis techniques and we conclude that both protocols assume different models in their local analysis. In particular, the compo- sitional analysis for overrun with payback (OWP) is not opaque and is pessimistic. The latter makes OWP expensive compared to its counter part without a payback mechanism (ONP). This paper presents an opaque and less pessimistic OWP analysis. Secondly, SIRAP requires more timing information to perform a task-level schedulability analysis. In many practical situations, however, detailed timing characteristics of tasks are hard to obtain. We introduce an opaque analysis for SIRAP using the analysis of ONP to reduce the required timing information during the local analysis. We show that the analysis for ONP cannot deem systems schedulable which are infeasible with SIRAP. The SIRAP analysis may therefore reduce the required system resources of a component by sacrificing the choice for an arbitrary synchronization protocol at system integration time.


@inproceedings{van den Heuvel2216,
author = {Martijn van den Heuvel and Moris Behnam and Reinder J. Bril and Johan Lukkien and Thomas Nolte},
title = {Opaque Analysis for Resource Sharing in Compositional Real-Time Systems},
month = {November},
year = {2011},
booktitle = {4th Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS11)},
url = {}