Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Dynamic scheduling in the presence of faults : specification and verification

Tools
- Tools
+ Tools

Janowski, Tomasz and Joseph, Mathai (1996) Dynamic scheduling in the presence of faults : specification and verification. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

[img]
Preview
PDF (Department of Computer Science Research Report)
WRAP_cs-rr-301.pdf - Other - Requires a PDF viewer.

Download (1427Kb) | Preview

Request Changes to record.

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 description language, define a language to describe anticipated faults and apply a version of 5-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.

Item Type: Report
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Real-time programming, Computer scheduling -- Mathematical models
Series Name: Department of Computer Science research report
Publisher: University of Warwick. Department of Computer Science
Official Date: March 1996
Dates:
DateEvent
March 1996Completion
Number: Number 301
Number of Pages: 18
DOI: CS-RR-301
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
Publisher Statement: T.&nbsp;Janowski and M.&nbsp;Joseph, &ldquo;Dynamic Scheduling in the Presence of Faults: Specification and Verification&rdquo;, <i>Proceedings of the 4th FTRTFT Symposium</i>, Sweden, Lecture Notes in Computer Science 1135, Springer-Verlag, pp.&nbsp;279-297 (1996)
Funder: Engineering and Physical Sciences Research Council (EPSRC)
Grant number: GR/H39499 (EPSRC)
Version or Related Resource: Janowski, T. and Joseph, M. (1996). Dynamic scheduling in the presence of faults : specification and verification. In: Jonsson, B. and Parrow, J., (eds.) Formal techniques in real-time and fault-tolerant systems. Lecture notes in computer science, 1135. Berlin: Springer, pp. 279-297.
Related URLs:
  • http://www2.warwick.ac.uk/fac/sci/dcs/
  • Related item in WRAP

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us