Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
Abstract
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.
Details
Original language | English |
---|---|
Title of host publication | Algebraic Informatics |
Editors | Traian Muntean, Dimitrios Poulakis, Robert Rolland |
Publisher | Springer, Berlin [u. a.] |
Pages | 4-5 |
Number of pages | 2 |
ISBN (print) | 978-3-642-40662-1 |
Publication status | Published - 2013 |
Peer-reviewed | Yes |
Publication series
Series | Lecture Notes in Computer Science, Volume 8080 |
---|---|
ISSN | 0302-9743 |
Conference
Title | 5th International Conference on Algebraic Informatics |
---|---|
Abbreviated title | CAI 2013 |
Conference number | |
Duration | 3 - 6 September 2013 |
Degree of recognition | International event |
Location | |
City | Porquerolles |
Country | France |
External IDs
Scopus | 84884707437 |
---|---|
ORCID | /0000-0002-5321-9343/work/142236748 |
Keywords
Keywords
- Randomized Distributed Systems, Probabilistic Automata