For stochastic hybrid systems, the reachability analysis is an important and difficult problem. In this paper, we prove that, under natural assumptions, reachability analysis can be characterised as an optimal stopping problem. In this way, one can apply numerical methods from optimal control to solve the reachability verification problems.

The program verification tool SLAyer uses abstractions during analysis and relies on a solver for reachability to refine spurious counterexamples. In this context, we extract a reachability benchmark suite and evaluate methods for encoding reachability properties with heaps using Horn clauses over linear arithmetic. The benchmarks are particularly challenging and we describe and evaluate pre-pr...

The reachability of standard and positive hybrid linear systems described by the general model is addressed. Necessary and sufficient conditions for the reachability of the standard general model are established. Sufficient condition is given for the reachability of positive hybrid system described by the general model. The considerations are illustrated by numerical examples.

In this paper we propose a scheme for reachability testing to achieve statement coverage in the dynamic testing of concurrent programs. Previous studies on reachability testing have only enumerated the feasible interleavings of a concurrent program for a given input. The proposed scheme derives inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachabil...

Increasingly more organizations are involved in critical cross-organizational business processes. Reachability analysis is one important way to guarantee the correctness of these processes. This paper proposes a new way of combing Role Network Model (RNM) and Picalculus to support reachability analysis for distributed and highly dyanmic processes. We first formally describe RNM in Pi-calculus. ...

I declare that I have developed and written the enclosed thesis completely by myself, and have not used sources or means without declaration in the text. A reachability query on a directed graph G asks if there exists a path from a node s to a node t. Answering such queries on large graph like datasets has become an issue in various fields of research and real world applications over the past 2...

Fluidification is a common relaxation technique used to deal in a more friendly way with large discrete event dynamic systems. In Petri nets, fluidification leads to continuous Petri nets systems in which the firing amounts are not restricted to be integers. For these systems reachability can be interpreted in several ways. The concepts of reachability and lim-reachability were considered in [7...

Internet multicast is transitioning from the flat, virtual topology known as the Multicast Backbone (MBone) to a hierarchical, globally deployed service. This transition introduces a number of important management issues. In particular, it is believed that the success of multicast on a large scale partly depends on the availability of good management tools. In this paper, we address the specifi...