Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata

Christel BaierChristel Baier

DOI Link

Christel Baier
Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata
Proc. of the 5th International Conference on Algebraic Informatics (CAI), volume 8080 of Lecture Notes in Computer Science, 4--5, 2013. Springer

Details
Bibtex

KurzfassungAbstract
The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision process (MDP) and a formalization of the desired event E by an ω-regular linear-time property, e.g., an LTL formula. The task is then to compute the greatest lower bound for the probability for E that can be guaranteed even in worst-case scenarios. Such bounds can be computed by a combination of polynomially time-bounded graph algorithm with methods for solving linear programs.
Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40663-8_2.

@inproceedings{B2013,
  author    = {Christel Baier},
  title     = {Quantitative Analysis of Randomized Distributed Systems and
               Probabilistic Automata},
  booktitle = {Proc. of the 5th International Conference on Algebraic
               Informatics (CAI)},
  series    = {Lecture Notes in Computer Science},
  volume    = {8080},
  publisher = {Springer},
  year      = {2013},
  pages     = {4--5},
  doi       = {10.1007/978-3-642-40663-8_2}
}