Departmental Papers (CIS)

Date of this Version

9-8-2010

Document Type

Conference Paper

Comments

The 8th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2010), IST Austria, Klosterneuburg, Austria , 8-10 September, 2010.

Abstract

As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using real-time scheduling theory with various notions of real-time tasks running under restricted resource supply environments. However, these approaches are limited in their expressiveness in that they are capable of describing resource-demand tasks, but not resource supplies.

This paper describes a process algebraic framework for reasoning about resource demand and supply inspired by the timed process algebra ACSR. In ACSR, realtime tasks are specified by enunciating their consumption needs for resources.

To also accommodate resource-supply processes we define PADS where, in addition to ACSR-like resource requests, we can specify availability of a resource in a given time step. Using PADS, we define a supply-demand relation where a pair (S; T) belongs to the relation if the demand process T can be scheduled under supply S. We develop a theory of compositional schedulability analysis as well as a technique for synthesizing an optimal supply process for a set of tasks. We illustrate our technique via a number of examples.

Subject Area

CPS Real-Time, CPS Formal Methods

Publication Source

Lecture Notes in Computer Science: Formal Modeling and Analysis of Timed Systems

Volume

6246

Start Page

183

Last Page

197

DOI

10.1007/978-3-642-15297-9_15

Copyright/Permission Statement

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-15297-9_15

Share

COinS
 

Date Posted: 08 December 2010

This document has been peer reviewed.