Advertisement

Abstract

We consider the problem of synthesizing digital designs from their ltl specification. In spite of the theoretical double exponential lower bound for the general case, we show that for many expressive specifications of hardware designs the problem can be solved in time N 3, where N is the size of the state space of the design. We describe the context of the problem, as part of the Prosyd European Project which aims to provide a property-based development flow for hardware designs. Within this project, synthesis plays an important role, first in order to check whether a given specification is realizable, and then for synthesizing part of the developed system.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AFF+02]
    Armoni, R., Fix, L., Flaisher, A., Gerth, R., Ginsburg, B., Kanza, T., Landver, A., Mador-Haim, S., Singerman, E., Tiemeyer, A., Vardi, M., Zbar, Y.: The ForSpec temporal logic: A new temporal property-specification language. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, p. 296. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. [AMPS98]
    Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: IFAC Symposium on System Structure and Control, pp. 469–474. Elsevier, Amsterdam (1998)Google Scholar
  3. [AO04]
    Inc. Accellera Organization. Formal semantics of Accellera(c) property specification language. Appendix B of (January 2004), http://www.eda.org/vfv/docs/PSL-v1.1.pdf
  4. [AT04]
    Alur, R., La Torre, S.: Deterministic generators and games for LTL fragments. ACM Trans. Comput. Log. 5(1), 1–25 (2004)CrossRefMathSciNetGoogle Scholar
  5. [BL69]
    Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. 138, 295–311 (1969)CrossRefMathSciNetGoogle Scholar
  6. [Bry86]
    Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(12), 1035–1044 (1986)CrossRefGoogle Scholar
  7. [CE81]
    Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  8. [Chu63]
    Church, A.: Logic, arithmetic and automata. In: Proc. 1962 Int. Congr. Math., pp. 23–25 (1962)Google Scholar
  9. [EL86]
    Emerson, E.A., Lei, C.L.: Efficient model-checking in fragments of the propositional modal μ-calculus. In: Proc. First IEEE Symp. Logic in Comp. Sci., pp. 267–278 (1986)Google Scholar
  10. [Eme97]
    Emerson, E.A.: Model checking and the μ-calculus. In: Immerman, N., Kolaitis, P.G. (eds.) Descriptive Complexity and Finite Models, pp. 185–214. AMS (1997)Google Scholar
  11. [Koz83]
    Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333–354 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  12. [KP00]
    Kesten, Y., Pnueli, A.: Verification by augmented finitary abstraction. Inf. and Comp. 163, 203–243 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  13. [KPP05]
    Kesten, Y., Piterman, N., Pnueli, A.: Bridging the gap between fair simulation and trace inclusion. Inf. and Comp. 200(1), 36–61 (2005)CrossRefMathSciNetGoogle Scholar
  14. [Lic91]
    Lichtenstein, O.: Decidability, Completeness, and Extensions of Linear Time Temporal Logic. PhD thesis, Weizmann Institute of Science (1991)Google Scholar
  15. [MW84]
    Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Sys. 6, 68–93 (1984)zbMATHCrossRefGoogle Scholar
  16. [PR89a]
    Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symp. Princ. of Prog. Lang., pp. 179–190 (1989)Google Scholar
  17. [PR89b]
    Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652–671. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  18. [PR90]
    Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proc. 31st IEEE Symp. Found. of Comp. Sci., pp. 746–757 (1990)Google Scholar
  19. [PS96]
    Pnueli, A., Shahar, E.: A platform for combining deductive with algorithmic verification. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 184–195. Springer, Heidelberg (1996)Google Scholar
  20. [Rab72]
    Rabin, M.O.: Automata on Infinite Objects and Churc’s Problem. Regional Conference Series in Mathematics, vol. 13. Amer. Math. Soc. (1972)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Nir Piterman
    • 1
  • Amir Pnueli
    • 2
  • Yaniv Sa’ar
    • 3
  1. 1.EPFL – I&C – MTCLausanneSwitzerland
  2. 2.Department of Computer ScienceWeizmann Institute of ScienceRehovotIsrael
  3. 3.Department of Computer ScienceBen Gurion UniversityBeer-ShevaIsrael

Personalised recommendations