Axiomatizations of temporal logics on trace systems

Abstract

Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations. The paper gives infinitary complete proof systems for several temporal logics on trace systems e.g. Partial Order Logic (POL), Computation Tree Logic with backward modalities, and an essential subset of Interleaving Set Temporal Logic (ISTL).

Keywords

Partial Order Temporal Logics Concurrency Trace Systems

Classification

Theory of Parallel and Distributed Computation Logic in Computer Science Semantics and Logics of Programming Languages