SAT–Based Bounded Strong Satisfiability Checking of Reactive System Specifications - Information and Communication Technology Access content directly
Conference Papers Year : 2013

SAT–Based Bounded Strong Satisfiability Checking of Reactive System Specifications

Abstract

Many fatal accidents involving safety-critical reactive systems have occurred in unexpected situations that were not considered during the design and test phases of the systems. To prevent these accidents, reactive systems should be designed to respond appropriately to any request from an environment at any time. Verifying this property during the specification phase reduces development reworking. This property of a specification is commonly known as realizability. Realizability checking for reactive system specifications involves complex and intricate analysis. For the purpose of detecting simple and typical defects in specifications, we introduce the notion of bounded strong satisfiability (a necessary condition for realizability), and present a method for checking this property. Bounded strong satisfiability is the property that for all input patterns represented by loop structures of a given size k, there is a response that satisfies a given specification. We present a checking method based on a satisfiability solver, and report experimental results.
Fichier principal
Vignette du fichier
978-3-642-36818-9_7_Chapter.pdf (116.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01480266 , version 1 (01-03-2017)

Licence

Attribution

Identifiers

Cite

Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki. SAT–Based Bounded Strong Satisfiability Checking of Reactive System Specifications. 1st International Conference on Information and Communication Technology (ICT-EurAsia), Mar 2013, Yogyakarta, Indonesia. pp.60-70, ⟨10.1007/978-3-642-36818-9_7⟩. ⟨hal-01480266⟩
47 View
71 Download

Altmetric

Share

Gmail Facebook X LinkedIn More