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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138:295–311, 1969.
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.
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.
A. Church. Logic, arithmetic and automata. In Proc. 1962 Int. Congr. Math., pages 23–25, Upsala, 1963.
R.L. Constable. Constructive mathematics as a programming logic I: Some principles of theory. Ann. Discrete Math., 24:21–38, 1985.
E.A. Emerson and J.Y. Halpern. 'sometimes’ and ‘not never’ revisited: On branching time versus linear time. J. ACM, 33:151–178, 1986.
C.C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21–52, 1961.
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.
D. Harel and A. Pnueli. On the development of reactive systems. In Logics and Models of Concurrent Systems, pages 477–498. Springer, 1985.
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.
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.
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.
Z. Manna and R.J. Waldinger. A deductive approach to program synthesis. ACM Trans. Prog. Lang. Syst., 2:90–121, 1980.
Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Syst., 6:68–93, 1984.
A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. Found. Comp. Sci., pages 46–57, 1977.
A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, pages 123–144. Springer, 1985.
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.
A. Pnueli and R. Rosner. On the synthesis of a reactive module. Technical report, Weizmann Institute of Science, 1988.
M.O. Rabin. Automata on Infinite Objects and Churc's Problem, volume 13 of Regional Conference Series in Mathematics. Amer. Math. Soc., 1972.
A.P. Sistla and E.M. Clarke. The complexity of propositional linear time logics. J. ACM, 32:733–749, 1985.
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.
Author information
Authors and Affiliations
Editor information
Rights 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