Skip to main content
SpringerLink
Log in

A framework for the synthesis of reactive modules

  • Invited Papers
  • Conference paper
  • First Online:
CONCURRENCY 88 (CONCURRENCY 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 335))

Included in the following conference series:

Abstract

We consider the synthesis of a reactive module with input x and output y, which is specified by the linear temporal formula ϕ(x, y). We show that there exists a program satisfying ϕ iff the branching time formula (∀x)(∃y)Aϕ(x, y) is valid over all tree models.

Extended Abstract

The work of this author was partially supported by the Eshkol Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138:295–311, 1969.

    Google Scholar 

  2. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. IBM Workshop on Logics of Programs, pages 52–71. Lec. Notes in Comp. Sci. 131, Springer, 1981.

    Google Scholar 

  3. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. Porg. Lang. Syst., 8:244–263, 1986.

    Google Scholar 

  4. A. Church. Logic, arithmetic and automata. In Proc. 1962 Int. Congr. Math., pages 23–25, Upsala, 1963.

    Google Scholar 

  5. R.L. Constable. Constructive mathematics as a programming logic I: Some principles of theory. Ann. Discrete Math., 24:21–38, 1985.

    Google Scholar 

  6. E.A. Emerson and J.Y. Halpern. 'sometimes’ and ‘not never’ revisited: On branching time versus linear time. J. ACM, 33:151–178, 1986.

    Google Scholar 

  7. C.C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21–52, 1961.

    Google Scholar 

  8. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symp. Principles Prog. Lang., pages 163–173, 1980.

    Google Scholar 

  9. D. Harel and A. Pnueli. On the development of reactive systems. In Logics and Models of Concurrent Systems, pages 477–498. Springer, 1985.

    Google Scholar 

  10. R. Hossley and C. Rackoff. The emptiness problem for automata on infinite trees. In Proc. 13th IEEE Symp. Switching and Automata Theory, pages 121–124, 1972.

    Google Scholar 

  11. T. Hafer and W. Thomas. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In Proc. 14th International Colloq. on Automata, Languages, and Programming, pages 269–279. Lec. Notes in Comp. Sci. 267, Springer, 1987.

    Google Scholar 

  12. Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, pages 215–273. Academic Press, London, 1982.

    Google Scholar 

  13. Z. Manna and R.J. Waldinger. A deductive approach to program synthesis. ACM Trans. Prog. Lang. Syst., 2:90–121, 1980.

    Google Scholar 

  14. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Syst., 6:68–93, 1984.

    Google Scholar 

  15. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. Found. Comp. Sci., pages 46–57, 1977.

    Google Scholar 

  16. A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, pages 123–144. Springer, 1985.

    Google Scholar 

  17. A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In Current Trends in Concurrency, pages 510–584. Lec. Notes in Comp. Sci. 224, Springer, 1986.

    Google Scholar 

  18. A. Pnueli and R. Rosner. On the synthesis of a reactive module. Technical report, Weizmann Institute of Science, 1988.

    Google Scholar 

  19. M.O. Rabin. Automata on Infinite Objects and Churc's Problem, volume 13 of Regional Conference Series in Mathematics. Amer. Math. Soc., 1972.

    Google Scholar 

  20. A.P. Sistla and E.M. Clarke. The complexity of propositional linear time logics. J. ACM, 32:733–749, 1985.

    Article  Google Scholar 

  21. R.J. Waldinger and R.C.T. Lee. PROW: A step towrds automatic program writing. In Proc. First Int. Joint Conf. on Artificial Inteligence, pages 241–252, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Weizmann Institute of Science, 76100, Rehovot, Israel

    Amir Pnueli & Roni Rosner

Authors
  1. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roni Rosner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frederich H. Vogt

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pnueli, A., Rosner, R. (1988). A framework for the synthesis of reactive modules. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-50403-6_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50403-0

  • Online ISBN: 978-3-540-45999-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation