Verifying Qualitative Properties of Probabilistic Programs

TitleVerifying Qualitative Properties of Probabilistic Programs
Publication TypeBook Chapter
Year of Publication2004
AuthorsBenedikt Bollig, Leucker, M
Book TitleValidation of Stochastic Systems
Series TitleLecture Notes in Computer Science
Volume2925
Pagination124–146
PublisherSpringer
Abstract

We present procedures for checking linear temporal logic and automata specifications of sequential and concurrent probabilistic programs. We follow two different approaches: For LTL and sequential probabilistic programs, our method proceeds in a tableau style fashion, while the remaining procedures are based on automata theory.

URLhttp://link.springer.de/link/service/series/0558/papers/
Bibtex: 
@inbook {BolligL03,
	title = {Verifying Qualitative Properties of Probabilistic Programs},
	booktitle = {Validation of Stochastic Systems},
	series = {Lecture Notes in Computer Science},
	volume = {2925},
	year = {2004},
	pages = {124{\textendash}146},
	publisher = {Springer},
	organization = {Springer},
	abstract = {We present procedures for checking linear temporal logic and automata specifications of sequential and concurrent probabilistic programs. We follow two different approaches: For LTL and sequential probabilistic programs, our method proceeds in a tableau style fashion, while the remaining procedures are based on automata theory.},
	url = {http://link.springer.de/link/service/series/0558/papers/},
	author = {Benedikt Bollig and Martin Leucker}
}
Postscript: