Completeness of neighbourhood logic

Authors:
Rana Barua;Suman Roy;Zhou Chaochen
Affiliations:
Stat-Math. unit, I.S.I., Calcutta, India;Computer Science and Automation, I.I.Sc., Bangalore, India;International Institute for Software Technology, UNU/IIST, Macau
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 8
Cited 1

A propositional modal logic of time intervals

Journal of the ACM (JACM)
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Verifying Hybrid Systems

Hybrid Systems
Hybrid Systems in TLA+

Hybrid Systems
An Extended Duration Calculus for Hybrid Real-Time Systems

Hybrid Systems
Complete Proof Systems for First Order Interval Temporal Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Temporal Logic for Multilevel Reasoning about Hardware

Computer

Probabilistic Neighbourhood Logic

FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of liveness and fairness properties of computing systems as well as formalisation of many concepts of real analysis. These two modalities are also adequate in the sense that they can derive other important unary and binary modalities of interval temporal logic. We prove the completeness result for NL by giving a Kripke model semantics and then mapping the Kripke models to the interval models for NL.