Toggle Main Menu Toggle Search

Open Access padlockePrints

An Application of Temporal Projection to Interleaving Concurrency

Lookup NU author(s): Dr Ben MoszkowskiORCiD


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


We revisit the earliest temporal projection operator. in discrete-time Propositional Interval Temporal Logic (PITL) and use it to formalise interleaving concurrency. The logical properties of. as a normal modality and a way to eliminate it in both PITL and conventional point-based Linear-Time Temporal Logic (LTL), which can be viewed as a PITL subset, are examined. We also formalise concurrency without II, and relate the two approaches. Furthermore, II and another standard PITL projection operator are interdefinable and both suitable for reasoning about different time granularities. We mention other (mostly interval-based) temporal logics with similar forms of projection, as well as some related applications and international standards.

Publication metadata

Author(s): Moszkowski B, Guelev DP

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: First International Symposium, SETTA 2015

Year of Conference: 2015

Pages: 153-167

Online publication date: 17/10/2015

Acceptance date: 01/01/1900

Publisher: Springer International Publishing


DOI: 10.1007/978-3-319-25942-0_10

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783319259413