Abstract
Realizability verification of reactive system specifications can detect dangerous situations that can arise, which were not expected while drawing the specifications. However, such verification typically involves complex, intricate analyses. The complexity of the realizability problem is 2EXPTIME-complete. To avoid this difficulty, Schewe et al. introduced the notion of bounded realizability. While realizability is the property that a model of a reactive system exists that satisfies a given specification, bounded realizability requires the existence of a model of size k that satisfies the given specification. They presented a method based on satisfiability modulo theories (SMT) for bounded realizability checking. Here, we present a more efficient method for checking bounded realizability. Our method reduces bounded realizability checking to satisfiability (SAT)-based reachability checking and is faster because in many cases, the result is obtained by reachability checking of small steps. We show the complexity of a bounded realizability problem for linear temporal logic (LTL) specifications is NEXPTIME-complete, in which the upper bound is derived from our SAT-encoding technique. We also report experimental results that show the effectiveness of our method.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: Ausiello, G., Dezani-Ciancaglini, M., Rocca, S.R.D. (eds.) Automata, Languages and Programming. LNCS, vol. 372, pp. 1–17. Springer, Heidelberg (1989)
Aoshima, T., Yonezaki, N.: Verification of reactive system specifications with outer event conditional formula. In: Proc. International Symposium on Principles of Software Evolution, pp. 189–193 (2000)
Armoni, R., Fix, L., Fraer, R., Huddleston, S., Piterman, N., Vardi, M.Y.: SAT-based induction for temporal safety properties. Electr. Notes Theor. Comput. Sci. 119(2), 3–16 (2005)
Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Boas, P.V.E.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Applied Mathematics, vol. 187, pp. 331–363 (1997)
Bohy, A., Bruyère, V., Filiot, E., Jin, N., Raskin, J.-F.: Acacia+, a tool for LTL synthesis. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 652–657. Springer, Heidelberg (2012)
Chlebus, B.S.: From domino tilings to a new model of computation. In: Skowron, A. (ed.) Computation Theory. LNCS, vol. 208, pp. 24–33. Springer, Heidelberg (1985)
Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The MathSAT5 SMT solver. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol. 7795, pp. 93–107. Springer, Heidelberg (2013)
Dutertre, B.: Yices 2.2. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 737–744. Springer, Heidelberg (2014)
Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Ehlers, R.: Unbeast: symbolic bounded synthesis. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 272–275. Springer, Heidelberg (2011)
Filiot, E., Jin, N., Raskin, J.-F.: An antichain algorithm for LTL realizability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 263–277. Springer, Heidelberg (2009)
Finkbeiner, B., Schewe, S.: SMT-based synthesis of distributed systems. In: Proc. Second Workshop on Automated Formal Methods, pp. 69–76 (2007)
Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: Proc. FMCAD, pp. 117–124 (2006)
Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: Proc. FOCS, pp. 531–542 (2005)
Mochizuki, S., Shimakawa, M., Hagihara, S., Yonezaki, N.: Fast translation from LTL to Büchi automata via non-transition-based automata. In: Merz, S., Pang, J. (eds.) ICFEM 2014. LNCS, vol. 8829, pp. 364–379. Springer, Heidelberg (2014)
Mori, R., Yonezaki, N.: Several realizability concepts in reactive objects. In: Proc. Information Modeling and Knowledge Bases IV: Concepts, Methods and Systems, pp. 407–424 (1993)
Piterman, N., Pnueli, A., Sa’ar, Y.: Synthesis of reactive(1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 364–380. Springer, Heidelberg (2006)
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. POPL, pp. 179–190 (1989)
Rosner, R.: Modular Synthesis of Reactive Systmes. Ph.D. thesis, Weizmann Institute of Science (1992)
Schewe, S., Finkbeiner, B.: Bounded synthesis. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 474–488. Springer, Heidelberg (2007)
Sheeran, M., Singh, S., Stålmarck, G.: Checking safety properties using induction and a SAT-solver. In: Johnson, S.D., Hunt Jr, W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 108–125. Springer, Heidelberg (2000)
Shimakawa, M., Hagihara, S., Yonezaki, N.: Complexity of strong satisfiability problems for reactive system specifications. IEICE Trans. Inf. & Syst. E96–D(10), 2187–2193 (2013)
Shimakawa, M., Hagihara, S., Yonezaki, N.: SAT–based bounded strong satisfiability checking of reactive system specifications. In: Mustofa, K., Neuhold, E.J., Tjoa, A.M., Weippl, E., You, I. (eds.) ICT-EurAsia 2013. LNCS, vol. 7804, pp. 60–70. Springer, Heidelberg (2013)
Shimakawa, M., Hagihara, S., Yonezaki, N.: Bounded strong satisfiability checking of reactive system specifications. IEICE Trans. Inf. & Syst. E97–D(7), 1746–1755 (2014)
Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733–749 (1985)
Tauriainen, H.: On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Shimakawa, M., Hagihara, S., Yonezaki, N. (2015). Reducing Bounded Realizability Analysis to Reachability Checking. In: Bojanczyk, M., Lasota, S., Potapov, I. (eds) Reachability Problems. RP 2015. Lecture Notes in Computer Science(), vol 9328. Springer, Cham. https://doi.org/10.1007/978-3-319-24537-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-24537-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24536-2
Online ISBN: 978-3-319-24537-9
eBook Packages: Computer ScienceComputer Science (R0)