A logic of probability with decidable model-checking

Danièle Beauquier; Alexander Rabinovich; Anatol Slissenko

doi:10.1007/3-540-45793-3_21

A logic of probability with decidable model-checking

Danièle Beauquier, Alexander Rabinovich, Anatol Slissenko

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Computer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings
Editors	Julian Bradfield
Publisher	Springer Verlag
Pages	306-321
Number of pages	16
ISBN (Print)	3540442405, 9783540442400
DOIs	https://doi.org/10.1007/3-540-45793-3_21
State	Published - 2002
Event	16th 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 2002 → 25 Sep 2002

Publication series

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

Conference

Conference	16th International Workshop on Computer Science Logic, CSL 2002 and 11th Annual Conference of the European Association for Computer Science Logic, EACSL 2002
Country/Territory	United Kingdom
City	Edinburgh
Period	22/09/02 → 25/09/02

Access to Document

10.1007/3-540-45793-3_21

Cite this

Beauquier, D., Rabinovich, A., & Slissenko, A. (2002). A logic of probability with decidable model-checking. In J. Bradfield (Ed.), Computer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings (pp. 306-321). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2471). Springer Verlag. https://doi.org/10.1007/3-540-45793-3_21

Beauquier, Danièle ; Rabinovich, Alexander ; Slissenko, Anatol. / A logic of probability with decidable model-checking. Computer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings. editor / Julian Bradfield. Springer Verlag, 2002. pp. 306-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

}

Beauquier, D, Rabinovich, A & Slissenko, A 2002, A logic of probability with decidable model-checking. in J Bradfield (ed.), Computer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2471, Springer Verlag, pp. 306-321, 16th 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, 22/09/02. https://doi.org/10.1007/3-540-45793-3_21

A logic of probability with decidable model-checking. / Beauquier, Danièle; Rabinovich, Alexander; Slissenko, Anatol.

Computer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings. ed. / Julian Bradfield. Springer Verlag, 2002. p. 306-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2471).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A logic of probability with decidable model-checking

AU - Beauquier, Danièle

AU - Rabinovich, Alexander

AU - Slissenko, Anatol

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - 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∗ .

AB - 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∗ .

UR - http://www.scopus.com/inward/record.url?scp=80055033513&partnerID=8YFLogxK

U2 - 10.1007/3-540-45793-3_21

DO - 10.1007/3-540-45793-3_21

M3 - פרסום בספר כנס

AN - SCOPUS:80055033513

SN - 3540442405

SN - 9783540442400

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 306

EP - 321

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

A2 - Bradfield, Julian

PB - Springer Verlag

Y2 - 22 September 2002 through 25 September 2002

ER -

Beauquier D, Rabinovich A, Slissenko A. A logic of probability with decidable model-checking. In Bradfield J, editor, Computer Science Logic - 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL 2002, Proceedings. Springer Verlag. 2002. p. 306-321. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45793-3_21

A logic of probability with decidable model-checking

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this