Abstract
We introduce a modal logic which can be used to formally reason about synchronous fixed connection multiprocess networks such as of VLSI. Our logic has both temporal and spatial modal operators. The various temporal modal operators allow us to relate properties of the current state of a given process with properties of succeeding states of the given process. Also, the spatial modal operators allow us to relate properties of the current state of a given process with properties of the current state of neighboring processes. Many interesting properties for multiprocessor networks can be elegantly expressed in our logic. We give examples of the diverse applications of our logic to packet routing, firing squad problems, and systolic algorithms.
We also present some results in the decidability and complexity issues in this logic.
This work was supported by the National Science Foundation Grants NSF MCS79-21024 and NSF MCS79-08365 and the. Office of Naval Research Contract N00014-80-0674.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
M. Ben-ari, Z. Manna, A. Pnueli, “The temporal logic of branching time,” 8th ACM Symposium on Principles of Programming Languages, Williamsburg, VA, 1981.
E.M. Clarke, A. Emerson, “Design and synthesis of programming skeletons using branching time temporal logic,” IBM Conference of Logics of Programs, May 1981.
S.N. Cole, “Real time computations by n-dimensional iterative arrays of finite state machines, IEEE Trans, on Computers, 18 (1969), pp. 349–365.
M. Fischer, R. Ladner, “Propositional dynamic logic of regular programs,” JCSS, 18(2), 1979.
D. Gabbay, A. Pnueli, S. Shealah, J. Stavi, “Temporal analysis of fairness,” 7th ACM Symposium on Principles of Programming Languages, Las Vegas, NV.
J.Y. Halpern, J.H. Reif, “The prepositional dynamic logic of deterministic, well-structured programs,” 22nd Symposium on Foundations of Computer Science, Nashville, TN, 1981.
Z. Manna, A. Pnueli, “Verification of concurrent programs,” The Correatness Problem in Computer Science, Academic Press, London, 1981.
S.R. Kosaraju, “Computations on iterative automata,” Ph.D. Thesis, University of Pennsylvania, PA, 1969.
A. Pnueli, “The temporal logic of programs,” Proceedings of 18th Symposium on Foundations of Computer Science, Providence, RI, Nov. 1977.
F.P. Preparata, J. Vuillemin, “The cube connected cycles: A versatile network for parallel computation,” FOCS 1979, pp. 140–147.
J.T. Schwartz, “Ultracomputers,” ACM Trans. on Programming Languages and Systems, Vol. 12, No. 4, Oct. 1980, pp. 484–521.
A.P. Sistla, E.M. Clarke, N. Francez, Y. Gurevich, “Are message buffers characterizable in linear temporal logic?”, Proceedings of the Symposium on Principles of Distributed Computing, Ottawa, Canada, August 1982.
A.P. Sistla, E.M. Clarke, “The complexity of propositional linear temporal logics,” ACM Symposium on Theory of Computing 1982, pp. 159–167.
H.S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. on Computers, Vol. C-20, No. 2, Feb. 1971, pp. 153–161.
H.T. Rung, C.E. Leiserson, Symposium on Sparse Matrix Computations and Their Applications, Knoxville, Tennessee., Nov. 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reif, J., Sistla, A.P. (1983). A multiprocess network logic with temporal and spatial modalities. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036943
Download citation
DOI: https://doi.org/10.1007/BFb0036943
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive