Reachability Analysis
Distributed Symbolic Reachability Analysis
... To answer SQ3, we investigated ways to most efficiently use RDMA in the various components of our BDD implementation. To minimize communication overhead we use one-sided RDMA, so that the CPUs on the targeted machines ...
88
Safe & robust reachability analysis of hybrid systems
... of reachability—namely, the reflexive and transitive closure of a transition relation—can be unsafe, ...safe reachability, which always computes a superset of the set of reachable ...safety analysis ...
25
Reachability analysis for the verification of adaptive protection setting selection logic
... In this section, the hybrid systems fundamentals presented thus far will be used to model an example adaptive distance protection scheme. This example is based on the previous work published in [7, 21]. In [21], it has ...
9
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
... for reachability analysis, which is an important component of model ...checking. Reachability analysis is often used as a preprocessing step before ...to reachability analysis ...
15
Reachability Analysis and Testing of Asynchronous Message-Passing Programs
... Existing reachability analysis approaches for asynchronous message-passing programs assume causal communication, which means that messages sent to the same destination be received in the same order as they ...
106
Liveness and Reachability Analysis of BPMN Process Models
... The remainder of this paper is organized as fol- lows. The next section proposes the work re- lated to our approach. Section 3 presents the technical background needed for the rest of the paper; it is divided into two ...
13
Memory Efficient All-Solutions SAT Solver and its Application for Reachability Analysis
... for reachability analysis, which is an important component of model ...checking. Reachability analysis is often used as a preprocessing step before ...to reachability analysis ...
27
Improving Reachability Analysis in Ltsmin Guards, Read, Write and Copy Dependencies for mcrl2, Promela and Dve
... For implementing the separation of read and write dependencies we will face four main challenges. The first is to come up with precise notions for read and write dependencies and letting algorithms exploit these. The ...
84
An incremental approach to reachability analysis of distributed programs with synchronous communication
... For a set M of CFSMs with a given set of internal channels, a CFSM describing the external behavior of M can be obtained by applying the all-at-once approach to construct RG(M,INT_C(M)) [r] ...
23
Reachability Analysis of Innermost Rewriting
... flow analysis of higher-order functional programs is a long standing research topic [KI13, OR11, KO11, ...and analysis results are thus coarse when program execution rely on a specific ...
32
Under the Hood of a Stand-Alone Lagrangian Reachability Tool
... [8] L. Cardelli, M. Tribastone, M. Tschaikowski, and A. Vandin. Maximal aggregation of polynomial dynamical systems. Proceedings of the National Academy of Sciences, 114(38):10029 – 10034, 2017. [9] L. Cardelli, M. ...
9
Reachability-based model reduction for Markov decision process
... This paper presents how to improve model reduction for Markov decision process (MDP), a technique that generates equivalent MDPs that can be smaller than the original MDP. In order to improve the current ...
16
The calculation of discriminating kernel based on viability kernel and reachability
... Reachability analysis and viability theory provide solid frameworks for control system of constrained dynamical systems in a set-valued fashion [, ...constrained reachability [] and viability ...
13
Reachability in pushdown register automata
... Global reachability We give a simple, exponential-time algorithm for global reachability ...This analysis asks for a representation of all configurations from which a specified set of target ...
27
Reachability of Patterned Conditional Pushdown Systems
... the reachability problem of CPDSs is EXPTIME- complete, which prevents the existence of an algorithm tractable for all instances in ...the reachability of patterned CPDS (pCPDS) that is a practically ...
16
Space Debris Collision Detection using Reachability
... enables analysis for such high-dimensional systems is that the dynamics of orbiting objects are disjoint from one another, and so rather than analyzing a single high-dimensional system, we analyze thousands of ...
11
Vector Reachability Problem in $\mathrm{SL}(2,\mathbb{Z})$
... vector reachability were shown to be at least NP-hard for SL(2, Z ) in [5, 4], but in the modular group case the membership is shown to be decidable in polynomial time by Gurevich and Schupp ...
15
Reachability in two-clock timed automata is PSPACE-complete
... In a recent paper, Haase et al. have shown a link between reachability in timed automata and reachability in bounded counter automata [5]. A bounded counter automaton is a non-deterministic finite automaton ...
22
On the Complexity of Reachability in Parametric Markov Decision Processes
... We have given an NP decision procedure for pMDPs with a fixed number of parameters. The exact complexity of pMDP reachability problems with this restriction remains open, and our upper bounds do not ...
17
Application layer reachability monitoring for IP multicast
... remaining analysis is based on characteriz- ing a specific type of reachability ...This analysis was conducted using the data set pro- duced by Phase 2 ...as reachability loss ...successful ...
19