| dc.identifier.uri | http://hdl.handle.net/11401/77237 | |
| dc.description.sponsorship | This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree. | en_US |
| dc.format | Monograph | |
| dc.format.medium | Electronic Resource | en_US |
| dc.language.iso | en_US | |
| dc.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dc.type | Dissertation | |
| dcterms.abstract | This thesis deals with verification of complex systems, which involve probabilistic choices. In total, we explore three interrelated problems. First, we explore probabilistic extensions of mu-calculus. GPL extends mu-calculus by having all the probabilistic choices made first; this keeps the model checking procedure decidable for any property. We extend GPL to a logic, XPL, which is undecidable, in general. We define a syntactic property of an XPL formula, separability, as a sufficient condition for model checking. Second, we can frame the problem of probabilistic model checking as query evaluation over probabilistic logic programs. We have developed an inference algorithm, PIP, using tabled logic programming, which is sufficiently powerful to verify GPL and separable XPL properties. PIP uses finite generative structures, called FEDs, to represent families of explanations. Finally, we explore an alternative paradigm for verification of temporal models: compositional or partial model checking. In particular, we employ a technique called quotienting, where we take a mu-calculus formula and a process and return another formula that must be satisfied by the remainder of the system. | |
| dcterms.available | 2017-09-20T16:52:15Z | |
| dcterms.contributor | Ramakrishnan, C. R. | en_US |
| dcterms.contributor | Stoller, Scott D | en_US |
| dcterms.contributor | Smolka, Scott A | en_US |
| dcterms.contributor | Cleaveland, Rance. | en_US |
| dcterms.creator | Gorlin, Andrey | |
| dcterms.dateAccepted | 2017-09-20T16:52:15Z | |
| dcterms.dateSubmitted | 2017-09-20T16:52:15Z | |
| dcterms.description | Department of Computer Science | en_US |
| dcterms.extent | 115 pg. | en_US |
| dcterms.format | Monograph | |
| dcterms.format | Application/PDF | en_US |
| dcterms.identifier | http://hdl.handle.net/11401/77237 | |
| dcterms.issued | 2016-12-01 | |
| dcterms.language | en_US | |
| dcterms.provenance | Made available in DSpace on 2017-09-20T16:52:15Z (GMT). No. of bitstreams: 1
Gorlin_grad.sunysb_0771E_13118.pdf: 934016 bytes, checksum: b926248c9831c17a2254afe6919a704b (MD5)
Previous issue date: 1 | en |
| dcterms.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dcterms.subject | branching time, logic programming, model checking, probabilistic systems | |
| dcterms.subject | Computer science | |
| dcterms.title | Verification of Probabilistic Branching Time Systems | |
| dcterms.type | Dissertation | |
