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

Towards a calculus of systems dependability

Tools
- Tools
+ Tools

Liu, Zhiming, Ravn, Anders P., Sørensen, Erling V. and Zhou, Chaochen (1992) Towards a calculus of systems dependability. 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-229.pdf - Other - Requires a PDF viewer.

Download (13Mb) | Preview

Request Changes to record.

Abstract

This paper presents a calculus that enables a designer of an embedded, real-time system to reason about and calculate whether a given requirement will hold with a sufficiently high probability for given failure probabilities of components used in the design of the system. The main idea is: - to specify requirements and design in DC (Duration Calculus, an extension of real-time, interval logic); - to define satisfaction probabilities for formulas in this calculus; - to establish a basic probabilistic calculus, PC, with rules that support calculation of the satisfaction probability for a composite formula from probabilities of its constituents; - to develop a collection of theorems expressing specific important PC formulas in terms of the probability matrices used in classical reliability engineering. These theorems are oriented towards systematic numerical calculations. This ensures that reasoning about probabilities is consistent with requirements and design decisions. We thus avoid introducing separate models for requirements and dependability analysis. The system model is a finite automaton with fixed transition probabilities. This defines discrete Markov processes as basis for the calculus.

Item Type: Report
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Interactive computer systems, Computer system failures -- Prevention
Series Name: Department of Computer Science research report
Publisher: University of Warwick. Department of Computer Science
Official Date: September 1992
Dates:
DateEvent
September 1992Completion
Number: Number 229
Number of Pages: 40
DOI: CS-RR-229
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
Reuse Statement (publisher, data, author rights): Z.&nbsp;Liu, Anders P.&nbsp;Ravn, Erlin V.&nbsp;Sorensen and Chaochen Zhao, &ldquo;Towards a Calculus of Systems Dependability&rdquo;, <i>Journal of High Integrity Systems</i> <b>1</b>(1), Oxford University Press, pp.&nbsp;49-65 (1994)
Funder: European Strategic Programme of Research and Development in Information Technology (ESPRIT), Danish Technical Research Council
Grant number: 3104 (ESPRIT), GR/D11521 (SERC), GR/H39499
Related URLs:
  • Organisation

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