Probabilistic Neighbourhood Logic

Authors:
Dimitar P. Guelev
Affiliations:
-
Venue:
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Year:
2000

Citing 4
Cited 4

An Adequate First Order Interval Logic

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Probabilistic Neighbourhood Logic

FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Temporal Logic for Multilevel Reasoning about Hardware

Computer
Completeness of neighbourhood logic

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Probabilistic Neighbourhood Logic

FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A branching time logic with two types of probability operators

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
A dose of timed logic, in guarded measure

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a probabilistic extension of Neighbourhood Logic (NL[14,1],). The study of such an extension is motivated by the need to supply the Probabilistic Duration Calculus (PDC,[10,4]) with a proof system. The relation between the new logic and PDC is similar to that between DC [15] and ITL [12,3]. We present a complete proof system for the new logic.