
A logic of probability with decidable modelchecking
Alexander Rabinovich
TelAviv University, Israel
(visits IT/UU, Sep 15  Oct 10, MIC 1:345B)
Abstract
A predicate logic of probability, close to logics of
probability of Halpern and al., is introduced. Our main result
concerns the following modelchecking problem: deciding whether a
given formula holds on the structure defined by a given Finite
Probabilistic Process. We show that this modelchecking problem
is decidable for a rather large subclass of formulas of a
secondorder monadic logic of probability. We discuss also the
decidability of satisfiability and compare our logic of
probability with the probabilistic temporal logic $pCTL^*$
introduced by Hansson and Jonsson.
Joint work with Daniele Beauquier and Anatol Slissenko
Welcome!
Sergei Vorobyov
Place: Information technology, Uppsala University
Room: 1113
Time: 13.1514.00 (+ discussions)
Room 1113 is in building 1, floor 1, room 13
(in the southern part of the building).
Help on how to find ASTEC Seminars.
There will be an extended period for discussions after the seminar.
Speakers are encouraged to give an short (5 min) introduction to the subject at the begining of the talk.
Listeners are excused if they have to leave after 14.00.
Everyone is welcome !
Updated 12Sep2002 16:33 by Roland Grönroos
email: info at astec.uu.se
Location: http://www.astec.uu.se/Seminars/02/0917.shtml
