Axiomatizations Of Interval Logics

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

Citing 15
Cited 1

Reasoning about networks with many identical finite state processes

Information and Computation
A propositional modal logic of time intervals

Journal of the ACM (JACM)
Graphical specifications for concurrent software systems

ICSE '92 Proceedings of the 14th international conference on Software engineering
Interval logics for temporal specification and verification

Interval logics for temporal specification and verification
A graphic environment for temporal reasoning

A graphic environment for temporal reasoning
A really abstract concurrent model and its temporal logic

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Process logic: preliminary report

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Hardware Semantics Based on Temporal Intervals

Proceedings of the 10th Colloquium on Automata, Languages and Programming
An Automata-Theoretic Decision Procedure for Future Interval Logic

Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
An Interval-Based Temporal Logic

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
A Low Level Language for Obtaining Decision Procedure for Classes of temporal Logics

Proceedings of the Carnegie Mellon Workshop 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
Propositional Temporal Interval Logic is PSPACE Complete

Proceedings of the 9th International Conference on Automated Deduction
A decidability result for a second order process logic

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Completeness And Soundness Of Axiomatizations For Temporal Logics Without Next

Fundamenta Informaticae

A graphical environment for the design of concurrent real-time systems

ACM Transactions on Software Engineering and Methodology (TOSEM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interval logic has been introduced as a temporal logic that provides higher-level constructs and an intuitive graphical representation, making it easier in interval logic than in other temporal logics to specify and reason about concurrency in software and hardware designs. In this paper we present axiomatizations for two propositional interval logics and relate these logics to Until Temporal Logic. All of these logics are discrete linear-time temporal logics with no next operator. The next operator obstructs the use of hierarchical abstraction and refinement, and makes reasoning about concurrency difficult.