Translator Disclaimer
Summer 1997 A Decidable Temporal Logic of Parallelism
Mark Reynolds
Notre Dame J. Formal Logic 38(3): 419-436 (Summer 1997). DOI: 10.1305/ndjfl/1039700748

Abstract

In this paper we shall introduce a simple temporal logic suitable for reasoning about the temporal aspects of parallel universes, parallel processes, distributed systems, or multiple agents. We will use a variant of the mosaic method to prove decidability of this logic. We also show that the logic does not have the finite model property. This shows that the mosaic method is sometimes a stronger way of establishing decidability.

Citation

Download Citation

Mark Reynolds. "A Decidable Temporal Logic of Parallelism." Notre Dame J. Formal Logic 38 (3) 419 - 436, Summer 1997. https://doi.org/10.1305/ndjfl/1039700748

Information

Published: Summer 1997
First available in Project Euclid: 12 December 2002

zbMATH: 0904.03010
MathSciNet: MR1624966
Digital Object Identifier: 10.1305/ndjfl/1039700748

Subjects:
Primary: 03B45
Secondary: 68Q60

Rights: Copyright © 1997 University of Notre Dame

JOURNAL ARTICLE
18 PAGES


SHARE
Vol.38 • No. 3 • Summer 1997
Back to Top