A logic of probability with decidable model-checking

Danièle Beauquier, Alexander Rabinovich, Anatol Slissenko

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 .

Original languageEnglish
Title of host publicationComputer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings
EditorsJulian Bradfield
PublisherSpringer Verlag
Pages306-321
Number of pages16
ISBN (Print)3540442405, 9783540442400
DOIs
StatePublished - 2002
Event16th International Workshop on Computer Science Logic, CSL 2002 and 11th Annual Conference of the European Association for Computer Science Logic, EACSL 2002 - Edinburgh, United Kingdom
Duration: 22 Sep 200225 Sep 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2471
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Workshop on Computer Science Logic, CSL 2002 and 11th Annual Conference of the European Association for Computer Science Logic, EACSL 2002
Country/TerritoryUnited Kingdom
CityEdinburgh
Period22/09/0225/09/02

Fingerprint

Dive into the research topics of 'A logic of probability with decidable model-checking'. Together they form a unique fingerprint.

Cite this