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

Scheduling Timed Modules for Correct Resource Sharing


Publication Type:

Conference/Workshop Paper


In Proc. of the 1st IEEE International Conference on Software Testing, Verification and Validation (ICST 2008)


IEEE Computer Society


Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized parallel executions may lead to hazard situations caused by e.g., race conditions. To be able to detect such faulty system behaviors before implementation, we introduce a unified model of resource constrained, scheduled real-time system descriptions, in Alur’s and Henzinger’s rigorous framework of timed reactive modules. We take a component-based design perspective and construct the real-time system model, by refinement, as a composition of real-time periodic preemptible tasks with encoded functionality, and a fixed-priority scheduler, all modeled as timed modules. For the model, we express the notions of race condition and redundant locking, formally, as invariance properties that can be verified by model-checking.


author = {Cristina Seceleanu and Paul Pettersson and Hans Hansson},
title = {Scheduling Timed Modules for Correct Resource Sharing},
month = {April},
year = {2008},
booktitle = {In Proc. of the 1st IEEE International Conference on Software Testing, Verification and Validation (ICST 2008)},
publisher = {IEEE Computer Society},
url = {}