Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Lehrstuhl Informatik 2 Zeit: Donnerstag, 11. Mrz 2010, 16.30 Uhr

Summary: Lehrstuhl Informatik 2
Zeit: Donnerstag, 11. März 2010, 16.30 Uhr
Ort: AH I, Ahornstr. 55
Referent: Dr. Michael Huth,
Imperial College, London (United Kingdom)
Titel: p-Automata: New Foundations for Discrete-Time
Probabilistic Verification
In the automata-based approach to verification, an automaton accepts as its lan-
guage a set of models. This approach comes with a host of important techniques that
make it widely used: specifications and models alike have meaning-preserving repre-
sentations as automata, model checking reduces to acceptance of input for an
automaton, satisfiability and validity checking reduce to emptiness and universality
checks of automata (respectively), automata are closed under Boolean operations,
model refinement reduces to language containment, and simulations efficiently un-
der-approximate language containment.
We develop such an automata-based approach to probabilistic verification that sup-
ports all techniques aforementioned, where models are countable, discrete-time, la-
beled Markov chains and probabilistic specifications subsume all formulas written in


Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)


Collections: Computer Technologies and Information Sciences