TY  - THES
T1  - Decision algorithms for probabilistic simulations
A1  - Zhang,Lijun
Y1  - 2009/09/15
N2  - Probabilistic phenomena arise in embedded, distributed, networked, biological and security systems, and are accounted for by various probabilistic modeling formalisms based on labelled transition systems. Among the most popular ones are homogeneous discretetime and continuous-time Markov chains (DTMCs and CTMCs) and their extensions with nondeterminism, which we will consider in this thesis. Simulation relations admit comparing the behavior of two models and provide the principal ingredients to perform abstractions of the models while preserving interesting properties. Intuitively, one model simulates another model if it can imitate all of its moves. Simulation preorders are compositional, thus allowing hierarchical verification and decomposition of difficult verification tasks into several subproblems. Recently, variants of simulation relations, such as simulatability and polynomially accurate probabilistic simulations, have been introduced to prove soundness of security protocols. The focus of this thesis lies in decision algorithms for various simulation preorders of probabilistic systems. We propose efficient decision algorithms and provide also experimental comparisons of these algorithms.
KW  - Simulation
KW  - Probabilistischer Algorithmus
KW  - Entscheidung
KW  - Transitionssystem
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2009/2424
ER  -