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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
