A Process Algebraic Approach to the Schedulability Analysisof Real-Time Systems

  • Authors:

  • Hanene Ben-Abdallah;Jin-Young Choi;Duncan Clarke;Young Si Kim;Insup Lee;Hong-Liang Xie

  • Affiliations:

  • Department of Computer Information and Science, University of Pennsylvania, Philadelphia, PA 19104;Department of Computer Information and Science, University of Pennsylvania, Philadelphia, PA 19104;Department of Computer Information and Science, University of Pennsylvania, Philadelphia, PA 19104;Department of Computer Information and Science, University of Pennsylvania, Philadelphia, PA 19104;Department of Computer Information and Science, University of Pennsylvania, Philadelphia, PA 19104;Department of Computer Information and Science, University of Pennsylvania, Philadelphia, PA 19104

  • Venue:
  • Real-Time Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

To engineerreliable real-time systems, it is desirable to detect timinganomalies early in the development process. However, there islittle work addressing the problem of accurately predicting timingproperties of real-time systems before implementations are developed.This paper describes an approach to the specification and schedulabilityanalysis of real-time systems based on the timed process algebraACSR-VP, which is an extension of ACSR with value-passing communicationand dynamic priorities. Combined with the existing features ofACSR for representing time, synchronization and resource requirements,ACSR-VP is capable of specifying a variety of real-time systemswith different scheduling disciplines in a modular fashion. Moreover,we can use VERSA, a toolkit we have developed for ACSR, to performschedulability analysis on real-time systems specified in ACSR-VPautomatically by checking for a certain bisimulation relation.