• Corpus ID: 62592186

Formal verification of probabilistic systems

@inproceedings{Alfaro1997FormalVO,
  title={Formal verification of probabilistic systems},
  author={Luca de Alfaro},
  year={1997}
}
This dissertation presents methods for the formal modeling and specification of probabilistic systems, and algorithms for the automated verification of these systems. Our system models describe the behavior of a system in terms of probability, nondeterminism, fairness and time. The formal specification languages we consider are based on extensions of branching-time temporal logics, and enable the expression of single-event and long-run average system properties. This latter class of properties… 

Three-Valued Abstraction for Stochastic Systems

TLDR
This thesis is concerned with abstraction, that is, with the reduction of available information in the system’s model, and the question of what properties are preserved when applying abstraction, and is focusing on the more intricate quantitative properties of probabilistic timed systems that can be expressed in PCTL and CSL.

Automated Verification Techniques for Probabilistic Systems

TLDR
Methods to analyse Markov decision processes, which model both stochastic and nondeterministic behaviour, and a wide range of their properties, including specifications in the temporal logics PCTL and LTL, probabilistic safety properties and cost- or reward-based measures are described.

Performance analysis of probabilistic timed automata using digital clocks

TLDR
The question of under what conditions digital clocks are sufficient for the performance analysis of Probabilistic timed automata is addressed and it is shown that this reduction is possible for an important class of systems and properties including probabilistic reachability and expected reachability.

Automated Verification and Strategy Synthesis for Probabilistic Systems

TLDR
This paper focuses on the model of Markov decision processes and uses property specifications based on probabilistic LTL and expected reward objectives to apply multi-objective model checking to investigate trade-offs between several properties, and extensions to stochastic multi-player games.

Probabilistic Timed Automata for Security Analysis and Design

TLDR
A general framework is proposed, which is based on Probabilistic Timed Automata, where both probabilistic and timing covert channels can be studied and model checking is used to study security issues affected by aspects of time and probability.

Verification of Real‐Time Probabilistic Systems

TLDR
This chapter gives an introduction to probabilistic timed automata, how to express properties of these models, and a range of model checking techniques that can be applied to them, and includes an example of their practical application to a case study: the IEEE 1394 FireWire root contention protocol.

Model Checking Probabilistic Systems

TLDR
This chapter presents the foundations of Probabilistic model checking, focusing on finite-state Markov decision processes as models and quantitative properties expressed in probabilistic temporal logic, and summarizes the main model-checking algorithms for both PCTL and LTL.

Implementation of symbolic model checking for probabilistic systems

TLDR
This thesis proposes a novel, hybrid approach, combining features of both symbolic and explicit implementations and shows that this technique can almost match the speed of sparse matrix based implementations, but uses significantly less memory.

Timed Automata

TLDR
A survey of the theory of timed automata and their role in specification and verification of real-time systems and much progress has been made in developing verification algorithms, heuristics, and tools.

On Model Checking Techniques for Randomized Distributed Systems

  • C. Baier
  • Computer Science, Mathematics
    IFM
  • 2010
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 and a formalization
...