Journal of the ACM (JACM)
A complete axiomatic characterization of first-order temporal logic of linear time
Theoretical Computer Science
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A concurrent branching time temporal logic
CSL '89 Proceedings of the third workshop on Computer science logic
Partial order logics for elementary net systems: state- and event-approaches
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
On undecidability of propositional temporal logics on trace systems
Information Processing Letters
Proving partial order properties
Theoretical Computer Science
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Transition systems, event structures, and unfoldings
Information and Computation
Algorithmic Logic
Axiomatizations of Temporal Logics on Trace Systems
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Propositional Temporal Logics and Equivalences
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Towards a temporal logic of causality and choice in distributed systems
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fairness for non-interleaving concurrency
Fairness for non-interleaving concurrency
| Hi-index | 0.00 |
Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations due to the fact that the complexity of their decidability problem is in II 1 1. This paper gives infinitary complete proof systems for several temporal logics on trace systems e.g. Computation Tree Logic with past operators and an essential subset of Interleaving Set Temporal Logic.