The complexity of probabilistic verification

We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic. For sequential programs, we present an algorithm that runs in time linear in the program and exponential in the specifica...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of the ACM 1995-07, Vol.42 (4), p.857-907
Hauptverfasser:	COURCOUBETIS, C, YANNAKAKIS, M
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Automata. Abstract machines. Turing machines Complexity Computer programming Computer science control theory systems Exact sciences and technology Logic programming Markov analysis Mathematical analysis Polynomials Probabilistic methods Probability Probability theory Software Software engineering Specifications Temporal logic Theoretical computing Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!