A Logic of Probability with Decidable Model-Checking

Authors:
Danièle Beauquier;Alexander Moshe Rabinovich;Anatol Slissenko
Affiliations:
-;-;-
Venue:
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Year:
2002

Citing 9
Cited 6

A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
An analysis of first-order logics of probability

Artificial Intelligence
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Reasoning about knowledge and probability

Journal of the ACM (JACM)
Decidability and expressiveness for first-order logics of probability

Information and Computation
The complexity of probabilistic verification

Journal of the ACM (JACM)
Time and Probability in Formal Design of Distributed Systems

Time and Probability in Formal Design of Distributed Systems
Proceedings of the First International Conference on Temporal Logic

ICTL '94 Proceedings of the First International Conference on Temporal Logic
It Usually Works: The Temporal Logic of Stochastic Systems

Proceedings of the 7th International Conference on Computer Aided Verification

A Logic Framework for Verification of Timed Algorithms

Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
A Decidable Probability Logic for Timed Probabilistic Systems

Fundamenta Informaticae
The well-designed logical robot: Learning and experience from observations to the Situation Calculus

Artificial Intelligence
Bounded rational search for on-the-fly model checking of LTL properties

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Approximate Verification of the Symbolic Dynamics of Markov Chains

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A Logic Framework for Verification of Timed Algorithms

Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata

Quantified Score

Hi-index	0.01

Visualization

Abstract

A predicate logic of probability, close to logics of probability of Halpern and al., is introduced. Our main result concerns the following model-checking problem: deciding whether a given formula holds on the structure defined by a given Finite Probabilistic Process. We show that this model-checking problem is decidable for a rather large subclass of formulas of a second-order monadic logic of probability. We discuss also the decidability of satisfiability and compare our logic of probability with the probabilistic temporal logic pCTL*.