158 research outputs found
Model Checking Omega-regular Properties for Quantum Markov Chains
No full textQuantum Markov chains are an extension of classical Markov chains which are labelled with super-operators rather than probabilities. They allow to faithfully represent quantum programs and quantum protocols. In this paper, we investigate model checking omega-regular properties, a very general class of properties (including, e.g., LTL properties) of interest, against this model.
For classical Markov chains, such properties are usually checked by building the product of the model with a language automaton. Subsequent analysis is then performed on this product. When doing so, one takes into account its graph structure, and for instance performs different analyses per bottom strongly connected component (BSCC). Unfortunately, for quantum Markov chains such an approach does not work directly, because super-operators behave differently from probabilities. To overcome this problem, we transform the product quantum Markov chain into a single super-operator, which induces a decomposition of the state space (the tensor product of classical state space and the quantum one) into a family of BSCC subspaces. Interestingly, we show that this BSCC decomposition provides a solution to the issue of model checking omega-regular properties for quantum Markov chains
Lazy Probabilistic Model Checking without Determinisation
No full textThe bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic Büchi automata is the inclusion of a determinisation step of the automaton under consideration.
In this paper, we show that full determinisation can be avoided: subset and breakpoint constructions suffice. We have implemented our approach - both explicit and symbolic versions - in a prototype tool. Our experiments show that our prototype can compete with mature tools like PRISM
Stadt-Theater Düsseldorf / Zar und Zimmermann : Donnerstag, den 7. Juni 1917 ; komische Oper in 3 Aufzügen
No full textvon Albert Lortzing. Spielleitung: Gustav Waschow. Musikalische Leitung: Moritz Grimm. Personen: Franz Hahn (vom Stadttheater Crefeld als Gast), Walter Krause, Gustav Waschow, Elisabeth Kandt, Robert Leffler, Adolf Jaeger, Ernst Bedau, Margarete Bedau, Carl Gericke. Holzschuhtanz, einstudiert von der Ballettmeisterin Marta Esche, getanzt vom Ballettpersona
Model-free reinforcement learning for stochastic parity games
No full textThis paper investigates the use of model-free reinforcement learning to compute the optimal value in two-player stochastic games with parity objectives. In this setting, two decision makers, player Min and player Max, compete on a finite game arena - a stochastic game graph with unknown but fixed probability distributions - to minimize and maximize, respectively, the probability of satisfying a parity objective. We give a reduction from stochastic parity games to a family of stochastic reachability games with a parameter ε, such that the value of a stochastic parity game equals the limit of the values of the corresponding simple stochastic games as the parameter ε tends to 0. Since this reduction does not require the knowledge of the probabilistic transition structure of the underlying game arena, model-free reinforcement learning algorithms, such as minimax Q-learning, can be used to approximate the value and mutual best-response strategies for both players in the underlying stochastic parity game. We also present a streamlined reduction from 112-player parity games to reachability games that avoids recourse to nondeterminism. Finally, we report on the experimental evaluations of both reductions
A Comparison of Time- and Reward-Bounded Probabilistic Model Checking Techniques
No full textIn the design of probabilistic timed systems, requirements concerning behaviour that occurs within a given time or energy budget are of central importance. We observe that model-checking such requirements for probabilistic timed automata can be reduced to checking reward-bounded properties on Markov decision processes. This is traditionally implemented by unfolding the model according to the bound, or by solving a sequence of linear programs. Neither scales well to large models. Using value iteration in place of linear programming achieves scalability but accumulates approximation error. In this paper, we correct the value iteration-based scheme, present two new approaches based on scheduler enumeration and state elimination, and compare the practical performance and scalability of all techniques on a number of case studies from the literature. We show that state elimination can significantly reduce runtime for large models or high bounds
Symblicit exploration and elimination for probabilistic model checking
No full textBinary decision diagrams can compactly represent vast sets of states, mitigating the state space explosion problem in model checking. Probabilistic systems, however, require multi-terminal diagrams storing rational numbers. They are inefficient for models with many distinct probabilities and for iterative numeric algorithms like value iteration. In this paper, we present a new "symblicit" approach to checking Markov chains and related probabilistic models: We first generate a decision diagram that symbolically collects all reachable states and their predecessors. We then concretise states one-by-one into an explicit partial state space representation. Whenever all predecessors of a state have been concretised, we eliminate it from the explicit state space in a way that preserves all relevant probabilities and rewards. We thus keep few explicit states in memory at any time. Experiments show that very large models can be model-checked in this way with very low memory consumption
Model checking stochastic hybrid systems
No full textThe interplay of random phenomena with discrete-continuous dynamics deserves increased attention in many systems of growing importance. Their verification needs to consider both stochastic behaviour and hybrid dynamics. In the verification of classical hybrid systems, one is often interested in deciding whether unsafe system states can be reached. In the stochastic setting, we ask instead whether the probability of reaching particular states is bounded by a given threshold. In this thesis, we consider stochastic hybrid systems and develop a general abstraction framework for deciding such problems. This gives rise to the first mechanisable technique that can, in practice, formally verify safety properties of systems which feature all the relevant aspects of nondeterminism, general continuous-time dynamics, and probabilistic behaviour. Being based on tools for classical hybrid systems, future improvements in the effectiveness of such tools directly carry over to improvements in the effectiveness of our technique.
We extend the method in several directions. Firstly, we discuss how we can handle continuous probability distributions. We then consider systems which we are in partial control of. Next, we consider systems in which probabilities are parametric, to analyse entire system families at once. Afterwards, we consider systems equipped with rewards, modelling costs or bonuses. Finally, we consider all orthogonal combinations of the extensions to the core model.In vielen Systemen wachsender Bedeutung tritt zufallsabhängiges Verhalten gleichzeitig mit diskret-kontinuierlicher Dynamik auf. Um solche Systeme zu verifizieren, müssen sowohl ihr stochastisches Verhalten als auch ihre hybride Dynamik betrachtet werden. In der Analyse klassischer hybrider Systeme ist eine wichtige Frage, ob unsichere Zustände erreicht werden können. Im stochastischen Fall fragen wir stattdessen nach garantierten Wahrscheinlichkeitsschranken. In dieser Arbeit betrachten wir stochastische hybride Systeme und entwickeln eine allgemeine Abstraktionsmethode um Probleme dieser Art zu entscheiden. Dies ermöglicht die erste automatische und praktisch anwendbare Methode, die Sicherheitseigenschaften von Systeme beweisen kann, in denen Nichtdeterminismus, komplexe Dynamik und probabilistisches Verhalten gleichzeitig auftreten. Da die Methode auf Analysetechniken für nichtstochastische hybride Systeme beruht, profitieren wir sofort von zukünftigen Verbesserungen dieser Verfahren.
Wir erweitern diese Grundmethode in mehrere Richtungen: Zunächst ergänzen wir das Modell um kontinuierliche Wahrscheinlichkeitsverteilungen. Dann betrachten wir partiell kontrollierbare Systeme. Als nächstes untersuchen wir parametrische Systeme, um eine Klasse ähnlicher Modelle gleichzeitig behandeln. Anschließend betrachten wir Eigenschaften, die auf der Abwägung von Kosten und Nutzen beruhen. Schließlich zeigen wir, wie diese Erweiterungen orthogonal kombiniert werden können
Ernst Moritz Arndt ein deutscher Patriot ; eine Lebensbeschreibung für Deutschlands Jugend
No full text
- …
