1,037 research outputs found
Explicit Model Checking of Very Large MDP using Partitioning and Secondary Storage
The applicability of model checking is hindered by the state space explosion
problem in combination with limited amounts of main memory. To extend its
reach, the large available capacities of secondary storage such as hard disks
can be exploited. Due to the specific performance characteristics of secondary
storage technologies, specialised algorithms are required. In this paper, we
present a technique to use secondary storage for probabilistic model checking
of Markov decision processes. It combines state space exploration based on
partitioning with a block-iterative variant of value iteration over the same
partitions for the analysis of probabilistic reachability and expected-reward
properties. A sparse matrix-like representation is used to store partitions on
secondary storage in a compact format. All file accesses are sequential, and
compression can be used without affecting runtime. The technique has been
implemented within the Modest Toolset. We evaluate its performance on several
benchmark models of up to 3.5 billion states. In the analysis of time-bounded
properties on real-time models, our method neutralises the state space
explosion induced by the time bound in its entirety.Comment: The final publication is available at Springer via
http://dx.doi.org/10.1007/978-3-319-24953-7_1
06172 Abstracts Collection -- Directed Model Checking
From 26.04.06 to 29.04.06, the Dagstuhl Seminar 06172 ``Directed Model Checking\u27\u27
was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Counterexample Generation in Probabilistic Model Checking
Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains. Finding the strongest evidence (i.e., the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that deviate most from the required probability bound can be obtained by applying (small amendments to) k-shortest (hop-constrained) paths algorithms. These results can be extended to Markov chains with rewards, to LTL model checking, and are useful for Markov decision processes. Experimental results show that typically the size of a counterexample is excessive. To obtain much more compact representations, we present a simple algorithm to generate (minimal) regular expressions that can act as counterexamples. The feasibility of our approach is illustrated by means of two communication protocols: leader election in an anonymous ring network and the Crowds protocol
Certificates and Witnesses for Probabilistic Model Checking
The ability to provide succinct information about why a property does, or does not, hold in a given system is a key feature in the context of formal verification and model checking.
It can be used both to explain the behavior of the system to a user of verification software, and as a tool to aid automated abstraction and synthesis procedures.
Counterexample traces, which are executions of the system that do not satisfy the desired specification, are a classical example.
Specifications of systems with probabilistic behavior usually require that an event happens with sufficiently high (or low) probability.
In general, single executions of the system are not enough to demonstrate that such a specification holds.
Rather, standard witnesses in this setting are sets of executions which in sum exceed the required probability bound.
In this thesis we consider methods to certify and witness that probabilistic reachability constraints hold in Markov decision processes (MDPs) and probabilistic timed automata (PTA).
Probabilistic reachability constraints are threshold conditions on the maximal or minimal probability of reaching a set of target-states in the system.
The threshold condition may represent an upper or lower bound and be strict or non-strict.
We show that the model-checking problem for each type of constraint can be formulated as a satisfiability problem of a system of linear inequalities.
These inequalities correspond closely to the probabilistic transition matrix of the MDP.
Solutions of the inequalities are called Farkas certificates for the corresponding property, as they can indeed be used to easily validate that the property holds.
By themselves, Farkas certificates do not explain why the corresponding probabilistic reachability constraint holds in the considered MDP.
To demonstrate that the maximal reachability probability in an MDP is above a certain threshold, a commonly used notion are witnessing subsystems.
A subsystem is a witness if the MDP satisfies the lower bound on the optimal reachability probability even if all states not included in the subsystem are made rejecting trap states.
Hence, a subsystem is a part of the MDP which by itself satisfies the lower-bounded threshold constraint on the optimal probability of reaching the target-states.
We consider witnessing subsystems for lower bounds on both the maximal and minimal reachability probabilities, and show that Farkas certificates and witnessing subsystems are related.
More precisely, the support (i.e., the indices with a non-zero entry) of a Farkas certificate induces the state-space of a witnessing subsystem for the corresponding property.
Vice versa, given a witnessing subsystem one can compute a Farkas certificate whose support corresponds to the state-space of the witness.
This insight yields novel algorithms and heuristics to compute small and minimal witnessing subsystems.
To compute minimal witnesses, we propose mixed-integer linear programming formulations whose solutions are Farkas certificates with minimal support.
We show that the corresponding decision problem is NP-complete even for acyclic Markov chains, which supports the use of integer programs to solve it.
As this approach does not scale well to large instances, we introduce the quotient-sum heuristic, which is based on iteratively solving a sequence of linear programs.
The solutions of these linear programs are also Farkas certificates.
In an experimental evaluation we show that the quotient-sum heuristic is competitive with state-of-the-art methods.
A large part of the algorithms proposed in this thesis are implemented in the tool SWITSS.
We study the complexity of computing minimal witnessing subsystems for probabilistic systems that are similar to trees or paths.
Formally, this is captured by the notions of tree width and path width.
Our main result here is that the problem of computing minimal witnessing subsystems remains NP-complete even for Markov chains with bounded path width.
The hardness proof identifies a new source of combinatorial hardness in the corresponding decision problem.
Probabilistic timed automata generalize MDPs by including a set of clocks whose values determine which transitions are enabled.
They are widely used to model and verify real-time systems.
Due to the continuously-valued clocks, their underlying state-space is inherently uncountable.
Hence, the methods that we describe for finite-state MDPs do not carry over directly to PTA.
Furthermore, a good notion of witness for PTA should also take into account timing aspects.
We define two kinds of subsystems for PTA, one for maximal and one for minimal reachability probabilities, respectively.
As for MDPs, a subsystem of a PTA is called a witness for a lower-bounded constraint on the (maximal or minimal) reachability probability, if it itself satisfies this constraint.
Then, we show that witnessing subsystems of PTA induce Farkas certificates in certain finite-state quotients of the PTA.
Vice versa, Farkas certificates of such a quotient induce witnesses of the PTA.
Again, the support of the Farkas certificates corresponds to the states included in the subsystem.
These insights are used to describe algorithms for the computation of minimal witnessing subsystems for PTA, with respect to three different notions of size.
One of them counts the number of locations in the subsystem, while the other two take into account the possible clock valuations in the subsystem.:1 Introduction
2 Preliminaries
3 Farkas certificates
4 New techniques for witnessing subsystems
5 Probabilistic systems with low tree width
6 Explications for probabilistic timed automata
7 Conclusio
A Survey on Continuous Time Computations
We provide an overview of theories of continuous time computation. These
theories allow us to understand both the hardness of questions related to
continuous time dynamical systems and the computational power of continuous
time analog models. We survey the existing models, summarizing results, and
point to relevant references in the literature
Computer Aided Verification
This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. The lack of formalization of the Internet architecture meant limited
abstractions and modularity, especially for the control and management planes,
thus requiring for every new need a new protocol built from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
Local abstraction refinement for probabilistic timed programs
We consider models of programs that incorporate probability, dense real-time and data. We present a new abstraction refinement method for computing minimum and maximum reachability probabilities for such models. Our approach uses strictly local refinement steps to reduce both the size of abstractions generated and the complexity of operations needed, in comparison to previous approaches of this kind. We implement the techniques and evaluate them on a selection of large case studies, including some infinite-state probabilistic real-time models, demonstrating improvements over existing tools in several cases
- …