Towards Efficient Parameterized Synthesis

  • Ayrat Khalimov
  • Swen Jacobs
  • Roderick Bloem
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7737)

Abstract

Parameterized synthesis was recently proposed as a way to circumvent the poor scalability of current synthesis tools. The method uses cut-off results in token rings to reduce the problem to bounded distributed synthesis, and thus ultimately to a sequence of SMT problems. This solves the problem of scalability in the size of the architecture, but experiments show that the size of the specification is still a major issue. In this paper we propose several optimizations of the approach. First, we tailor the SMT encoding to systems with isomorphic processes and token-ring architecture. Second, we extend the cut-off results for token rings and refine the reduction, using modularity and abstraction techniques. Some of our optimizations also apply to isomorphic or distributed synthesis in arbitrary architectures. To evaluate these optimizations, we developed the first completely automatic implementation of parameterized synthesis. Experiments show a speed-up of several orders of magnitude, compared to the original method.

Keywords

Global State Label Transition System Parameterized Synthesis Strongly Connect Component Parameterized Architecture 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babiak, T., Křetínský, M., Řehák, V., Strejček, J.: LTL to Büchi Automata Translation: Fast and More Deterministic. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 95–109. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  2. 2.
    Bloem, R., Cimatti, A., Greimel, K., Hofferek, G., Könighofer, R., Roveri, M., Schuppan, V., Seeber, R.: RATSY – A New Requirements Analysis Tool with Synthesis. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 425–429. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa’ar, Y.: Synthesis of reactive(1) designs. Journal of Computer and System Sciences 78, 911–938 (2012)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Chapiro, D.M.: Globally-asynchronous locally-synchronous systems. Ph.D. thesis, Stanford Univ., CA (1984)Google Scholar
  5. 5.
    Clarke, E.M., Talupur, M., Touili, T., Veith, H.: Verification by Network Decomposition. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 276–291. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Ehlers, R.: Symbolic bounded synthesis. Formal Methods in System Design 40, 232–262 (2012)MATHCrossRefGoogle Scholar
  8. 8.
    Emerson, E.A., Namjoshi, K.S.: On reasoning about rings. International Journal of Foundations of Computer Science 14, 527–549 (2003)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Filiot, E., Jin, N., Raskin, J.F.: Antichains and compositional algorithms for LTL synthesis. Form. Methods Syst. Des. 39(3), 261–296 (2011)MATHCrossRefGoogle Scholar
  10. 10.
    Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Logic in Computer Science (LICS), pp. 321–330. IEEE Computer Society Press (2005)Google Scholar
  11. 11.
    Finkbeiner, B., Schewe, S.: SMT-based synthesis of distributed systems. In: Proc. Workshop on Automated Formal Methods, pp. 69–76. ACM (2007)Google Scholar
  12. 12.
    Finkbeiner, B., Schewe, S.: Bounded synthesis. Int. J. on Software Tools for Technology Transfer, 1–21 (2012)Google Scholar
  13. 13.
    Jacobs, S., Bloem, R.: Parameterized Synthesis. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 362–376. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  14. 14.
    Katz, G., Peled, D.: Synthesizing Solutions to the Leader Election Problem Using Model Checking and Genetic Programming. In: Namjoshi, K., Zeller, A., Ziv, A. (eds.) HVC 2009. LNCS, vol. 6405, pp. 117–132. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    Pnueli, A., Rosner, R.: Distributed systems are hard to synthesize. In: Foundations of Computer Science (FOCS), pp. 746–757. IEEE Computer Society Press (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ayrat Khalimov
    • 1
  • Swen Jacobs
    • 1
  • Roderick Bloem
    • 1
  1. 1.Graz University of TechnologyAustria

Personalised recommendations