A Decomposition Method for the Verification of a Real-Time Safety-Critical Protocol

Formal methods, especially model checking techniques, are often used for the verification of the resilience of safety critical systems. The usual complexity of the verification problem in real life systems (due to state space explosion and the handling of time dependent behavior) demands efficient t...

Full description

Saved in:
Bibliographic Details
Published inSoftware Engineering for Resilient Systems Vol. 9274; pp. 31 - 45
Main Authors Tóth, Tamás, Vörös, András, Majzik, István
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 01.01.2015
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Fault Transition
Information retrieval
Linear Temporal Logic
Model Check Problem
Network hardware
Safety Critical System
Software Engineering
Transient Fault
Online AccessGet full text

Cover

More Information
Summary:Formal methods, especially model checking techniques, are often used for the verification of the resilience of safety critical systems. The usual complexity of the verification problem in real life systems (due to state space explosion and the handling of time dependent behavior) demands efficient techniques. In this paper we propose a decomposition approach: the layered structure of the system is exploited to decompose the verification problem to smaller and tractable ones. In addition, the structure of the requirements (formalized as the combination of reachability and liveness properties) is also exploited to construct simpler verification problems for the model checker. The decomposition approach is demonstrated in case of the verification of a distributed protocol in a SCADA system that shall provide functionality even after the occurrence of a finite number of transient faults.
ISBN:3319231286
9783319231280
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-23129-7_3