Skip to main content
SpringerLink
Log in

Specification and Compositional Verification of Real-Time Systems

  • Book
  • © 1991

Overview

Authors:
  1. Jozef Hooman
    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 558)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-10

  3. Compositionality

    Pages 11-54

  4. Compositionality and real-time

    Pages 55-102

  5. Adding program variables

    Pages 103-128

  6. Shared processors

    Pages 129-160

  7. Concluding remarks

    Pages 161-166

  8. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

The research described in this monograph concerns the formal specification and compositional verification of real-time systems. A real-time programminglanguage is considered in which concurrent processes communicate by synchronous message passing along unidirectional channels. To specifiy functional and timing properties of programs, two formalisms are investigated: one using a real-time version of temporal logic, called Metric Temporal Logic, and another which is basedon extended Hoare triples. Metric Temporal Logic provides a concise notationto express timing properties and to axiomatize the programming language, whereas Hoare-style formulae are especially convenient for the verification of sequential constructs. For both approaches a compositional proof system has been formulated to verify that a program satisfies a specification. To deduce timing properties of programs, first maximal parallelism is assumed, modeling the situation in which each process has itsown processor. Next, this model is generalized to multiprogramming where several processes may share a processor and scheduling is based on priorities. The proof systems are shown to be sound and relatively complete with respect to a denotational semantics of the programming language. The theory is illustrated by an example of a watchdog timer.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation