Possibilistic and Probabilistic Abstraction-Based Model Checking (2002)
| Venue: | Process Algebra and Probabilistic Methods, Performance Modeling and Veri Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science |
| Citations: | 4 - 2 self |
BibTeX
@INPROCEEDINGS{Huth02possibilisticand,
author = {Michael Huth},
title = {Possibilistic and Probabilistic Abstraction-Based Model Checking},
booktitle = {Process Algebra and Probabilistic Methods, Performance Modeling and Veri Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science},
year = {2002},
pages = {115--134},
publisher = {Springer Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
models whose verification results transfer to the abstracted models for a logic with unrestricted use of negation and quantification. This framework is novel in that its models have quantitative or probabilistic observables and state transitions. Properties of a quantitative temporal logic have measurable denotations in these models. For probabilistic models such denotations approximate the probabilistic semantics of full LTL. We show how predicate-based abstractions specify abstract quantitative and probabilistic models with finite state space. 1
