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. In: Jonsson, B. and Parrow, J., (eds.) Formal Techniques in Real-Time and Fault-Tolerant Systems. Lecture Notes in Computer Science, Volume 1135 . Springer Berlin Heidelberg, pp. 279-297. ISBN 3540616489

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1007/3-540-61648-9_46

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 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.

Item Type: Book Item
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Series Name: Lecture Notes in Computer Science
Publisher: Springer Berlin Heidelberg
ISBN: 3540616489
ISSN: 0302-9743
Book Title: Formal Techniques in Real-Time and Fault-Tolerant Systems
Editor: Jonsson, B. and Parrow, J.
Official Date: 1996
Dates:
DateEvent
1996Published
Volume: Volume 1135
Number of Pages: 19
Page Range: pp. 279-297
Status: Not Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Version or Related Resource: Janowski, T. and Joseph, M. (1996). Dynamic scheduling in the presence of faults : specification and verification. University of Warwick. Department of Computer Science. (Department of Computer Science research report, 301).
Title of Event: 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Location of Event: Uppsala, Sweden
Date(s) of Event: 09-13 Sep 1996
Related URLs:
  • Related item in WRAP

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

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