@inproceedings{7fd9d7315ebd400e969771468d5bd7e7,

title = "A logic of probability with decidable model-checking",

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∗ .",

author = "Dani{\`e}le Beauquier and Alexander Rabinovich and Anatol Slissenko",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; null ; Conference date: 22-09-2002 Through 25-09-2002",

year = "2002",

doi = "10.1007/3-540-45793-3_21",

language = "אנגלית",

isbn = "3540442405",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "306--321",

editor = "Julian Bradfield",

booktitle = "Computer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings",

}