Verifying Temporal Properties of Systems

Bradfield Julian Charles

ISBN 10: 0817636250 / ISBN 13: 9780817636258

Published by Springer, 1992

About this Item

pp. 113.

Seller Inventory # 7423334

Bibliographic Details

• Title: Verifying Temporal Properties of Systems
• Publisher: Springer
• Publication Date: 1992
• Language: English
• ISBN 10: 0817636250
• ISBN 13: 9780817636258
• Binding: Hardcover
• Condition: New

About this title

Synopsis

This monograph aims to provide a powerful general-purpose proof tech­ nique for the verification of systems, whether finite or infinite. It extends the idea of finite local model-checking, which was introduced by Stirling and Walker: rather than traversing the entire state space of a model, as is done for model-checking in the sense of Emerson, Clarke et ai. (checking whether a (finite) model satisfies a formula), local model-checking asks whether a particular state satisfies a formula, and only explores the nearby states far enough to answer that question. The technique used was a tableau method, constructing a tableau according to the formula and the local structure of the model. This tableau technique is here generalized to the infinite case by considering sets of states, rather than single states; because the logic used, the propositional modal mu-calculus, separates simple modal and boolean connectives from powerful fix-point operators (which make the logic more expressive than many other temporal logics), it is possible to give a rela­ tively straightforward set of rules for constructing a tableau. Much of the subtlety is removed from the tableau itself, and put into a relation on the state space defined by the tableau-the success of the tableau then depends on the well-foundedness of this relation. The generalized tableau technique is exhibited on Petri nets, and various standard notions from net theory are shown to playa part in the use of the technique on nets-in particular, the invariant calculus has a major role.

Synopsis

This monograph presents a novel and powerful general-purpose proof technique for verifying concurrent systems, both finite and infinite. The technique used is a tableau method, based on the logic of the modal mu-calculus, that makes it possible to give a relatively straightforward set of rules for constructing a tableau from a given formula and the