Abstract
In this paper, we apply Propositional Temporal Logic (PTL) to the specification and synthesis of the synchronization part of communicating processes. To specify a process, we give a PTL formula that describes its sequence of communications. The synthesis is done by constructing a model of the given specifications using a tableau-like satisfiability algorithm for PTL. This model can then be interpreted as a program.
This research was supported in part by the National Science Foundation under grant MCS80-06930, by the Office of Naval Research under Contract N00014-76-C-0687, by the United States Air Force Office of Scientific Research under Grant AFSOR-81-0014 and by an IBM Predoctoral Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ben-Ari, Z. Manna, A. Pnueli, “The Logic of Nexttime”, Eighth ACM Symposium on Principles of Programming Languages, Williamsburg, VA, January 1981, pp. 164–176.
E. M. Clarke, E. A. Emerson, “Synthesis of Synchronization Skeletons from Branching Time Temporal Logic”, Proceedings of the Workshop on Logics of Programs, Yorktown-Heights, NY, Springer-Verlag Lecture Notes in Computer Science, 1981
D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, “The Temporal Analysis of Fairness”, Seventh ACM Symposium on Principles of Programming Languages, Las Vegas, NV, January 1980, pp. 163–173.
P. Griffiths, “SYNVER: A System for the Automatic Synthesis and Verification and Synthesis of Synchronization Processes”, Ph. D. Thesis, Harvard University, June 1975.
A. N. Habermann, “Path Expressions”, Computer Science Report, Carnegie-Mellon University, 1975.
C. A. R. Hoare, “Communicating Sequential Processes”, Communications of the ACM, Vol. 21, No 8 (August 1978), pp. 666–677.
M. Laventhal, “Synthesis of Synchronization Code for Data Abstractions”, Ph. D. Thesis, MIT, June 1978.
Z. Manna, A. Pnueli, “Verification of Concurrent Programs: the Temporal Framework”, The Correctness Problem in Computer Science (R. S. Boyer and J S. Moore, eds.), Internation Lecture Series in Computer Science, Academic Press, London, 1981.
A. Pnueli, “The Temporal Logic of Programs”, Proceedings of the Eighteenth Symposium on Foundations of Computer Science, Providence, RI, November 1977, pp. 46–57.
A. Prior, Past, Present and Future, Oxford University Press, 1967.
N. Rescher, A. Urquart, Temporal Logic, Springer-Verlag, 1971
K. Ramamritham, R. M. Keller, “Specification and Synthesis of Synchronizers”, Proceedings International Symposium on Parallel Processing, August 1980, pp. 311–321.
R. M. Smullyan, First Order Logic, Springer-Verlag, Berlin, 1968.
P. Wolper, “Temporal Logic Can Be More Expressive”, Proceedings of the Twenty-Second Symposium on Foundations of Computer Science, Nashville, TN, October 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manna, Z., Wolper, P. (1982). Synthesis of communicating processes from Temporal Logic specifications. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025786
Download citation
DOI: https://doi.org/10.1007/BFb0025786
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11212-9
Online ISBN: 978-3-540-39047-3
eBook Packages: Springer Book Archive