Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, March 1, 2017 - 11:33:58 AM
Last modification on : Wednesday, March 1, 2017 - 11:36:36 AM
Long-term archiving on: : Tuesday, May 30, 2017 - 4:01:01 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads