Completeness And Soundness Of Axiomatizations For Temporal Logics Without Next

Authors:
L.E. Moser;P.M. Melliar-Smith;G. Kutty;Y.S. Ramakrishna
Affiliations:
Department of Electrical and Computer Engineering University of California, Santa Barbara;Department of Electrical and Computer Engineering University of California, Santa Barbara;Department of Electrical and Computer Engineering University of California, Santa Barbara;Department of Electrical and Computer Engineering University of California, Santa Barbara
Venue:
Fundamenta Informaticae
Year:
1994

Citing 11
Cited 1

Reasoning about networks with many identical finite state processes

Information and Computation
Composing specifications

REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Specifying Concurrent Program Modules

ACM Transactions on Programming Languages and Systems (TOPLAS)
A really abstract concurrent model and its temporal logic

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the Relation of Programs and Computations to Models of Temporal Logic

Temporal Logic in Specification
The Glory of the Past

Proceedings of the Conference on Logic of Programs
The anchored version of the temporal framework

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems

Temporal Logic in Specification
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Axiomatizations Of Interval Logics

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present axiomatizations for Until Temporal Logic (UTL) and for Since/Until Temporal Logic (SUTL). These logics are intended for use in specifying and reasoning about concurrent systems. They employ neither a next nor a previous operator, which obstruct the use of hierarchical abstraction and refinement, and make reasoning about concurrency difficult. We also provide a procedure for translating SUTL formulas into UTL formulas, and demonstrate that the axiomatizations are sound and complete with respect to the class of ω-sequences. We show, however, that the axiomatization of UTL admits models that the axiomatization of SUTL does not, thereby demonstrating that the logics are not equivalent.