Name
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 development. To prevent such 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. The complexity of realizability problems is 2EXPTIME-complete. To detect typical simple deficiencies in specifications efficiently, 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 report a checking method based on a satisfiability solver, and show that the complexity of the bounded strong satisfiability problem is co-NEXPTIME-complete. Moreover, we report experimental results showing that our method is more efficient than existing approaches. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1587/transinf.E97.D.1746 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
reactive system, bounded analysis, SAT solver, realizability, LTL specification | Programming language,Computer science,Satisfiability,Boolean satisfiability problem,Reactive system,Realizability,Bounded function | Journal |
Volume | Issue | ISSN |
E97D | 7 | 1745-1361 |
Citations | PageRank | References |
3 | 0.41 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masaya Shimakawa | 1 | 41 | 7.54 |
| Shigeki Hagihara | 2 | 78 | 12.33 |
| Naoki Yonezaki | 3 | 107 | 20.02 |