Specification and Compositional Verification of Real-Time Systems (Lecture Notes in Computer Science 558)

Hooman, J.

ISBN 10: 0387549471 / ISBN 13: 9780387549477

Published by Springer-Verlag, Berlin, 1991

About this Item

Lecture Notes in Computer Science 558; Ex-Library. Previous owner's sticker on the front cover. Ink stamp on half-title page. Library catalogue sticker inside front cover. Faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG.

Seller Inventory # 094441

Bibliographic Details

• Title: Specification and Compositional Verification of Real-Time Systems (Lecture Notes in Computer Science 558)
• Publisher: Springer-Verlag, Berlin
• Publication Date: 1991
• Language: English
• ISBN 10: 0387549471
• ISBN 13: 9780387549477
• Binding: Paperback
• Condition: Very Good
• Dust Jacket Condition: No Dust Jacket
• Book Type: Ex-Library
• Seller catalogs:
  • Computers & Technology (incl. AI)

About this title

Synopsis

The research described in this monograph concerns the formal specification and compositional verification of real-time systems. A real-time programming language 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 based on extended Hoare triples. Metric Temporal Logic provides a concise notation to 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 its own 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.