A multiprocess network logic with temporal and spatial modalities

Published

Conference Paper

© 1983, Springer-Verlag. 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.

Full Text

Duke Authors

Cited Authors

  • Reif, J; Sistla, AP

Published Date

  • January 1, 1983

Published In

Volume / Issue

  • 154 LNCS /

Start / End Page

  • 629 - 639

Electronic International Standard Serial Number (EISSN)

  • 1611-3349

International Standard Serial Number (ISSN)

  • 0302-9743

International Standard Book Number 13 (ISBN-13)

  • 9783540123170

Digital Object Identifier (DOI)

  • 10.1007/BFb0036943

Citation Source

  • Scopus