Article thumbnail
Location of Repository

Dynamic scheduling in the presence of faults : specification and verification

By Tomasz Janowski and Mathai Joseph

Abstract

A distributed real-time program is usually executed on a limited set of hardware resources and is required to satisfy timing constraints, despite anticipated hardware failures. Static analysis of the timing properties of such programs is often infeasible. This paper shows how to formally reason about these programs when scheduling decisions are made on-line and take into account deadlines, load and hardware failures. We use Timed CCS as a process language, define a language to describe anticipated faults and apply a version of a mu-calculus to specify and verify timing properties. This allows the property of schedulability to be the outcome of an equation-solving problem. And unlike conventional reasoning, the logic is fault-monotonic: if correctness is proved for a number of faults, correctness for any subset of these faults is guaranteed

Topics: QA76
Publisher: Springer Berlin Heidelberg
Year: 1996
DOI identifier: 10.1007/3-540-61648-9_46
OAI identifier: oai:wrap.warwick.ac.uk:17762
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://wrap.warwick.ac.uk/6098... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.