Portal de Periódicos da CAPES

A Decidable Temporal Logic of Parallelism

1997; Duke University Press; Volume: 38; Issue: 3 Linguagem: Inglês

10.1305/ndjfl/1039700748

1939-0726

Mark Reynolds,

Logic, programming, and type systems

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.