Results 31 to 40 of about 24,416 (155)
Improving Reachability Analysis of Infinite State Systems by Specialization [PDF]
, 2011 We consider infinite state reactive systems specified by using linear constraints over the integers, and we address the problem of verifying safety properties of these systems by applying reachability analysis techniques.
Senni, V +12 more
core +1 more source
Reachability in symmetric VASS
CoRRWe investigate the reachability problem in symmetric vector addition systems with states (VASS), where transitions are invariant under a group of permutations of coordinates. One extremal case, the trivial groups, yields general VASS. In another extremal case, the symmetric groups, we show that the reachability problem can be solved in PSPACE ...
Kamiński, Łukasz, Lasota, Sławomir
openaire +5 more sources
How to stop time stopping [PDF]
, 2006 Zeno-timelocks constitute a challenge for the formal verification of timed automata: they are difficult to detect, and the verification of most properties (e.g., safety) is only correct for timelock-free models.
Gomez, Rodolfo, Bowman, Howard
core +1 more source
On Affine Reachability Problems
, 2019 We analyze affine reachability problems in dimensions 1 and 2. We show that the reachability problem for 1-register machines over the integers with affine updates is PSPACE-hard, hence PSPACE-complete, strengthening a result by Finkel et al. that required polynomial updates.
Jaax, S, Kiefer, S
openaire +6 more sources
On Affine Reachability Problems [PDF]
, 2020 We analyze affine reachability problems in dimensions 1 and 2. We show that the reachability problem for 1-register machines over the integers with affine updates is PSPACE-hard, hence PSPACE-complete, strengthening a result by Finkel et al.
Kiefer, Stefan, Jaax, Stefan
core +1 more source
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luca de Alfaro +2 more
openaire +3 more sources
Introducing robust reachability
, 2022 International audienceWe introduce a new property called robust reachability which refines the standard notion of reachability in order to take replicability into account.
Girol, Guillaume +2 more
core +1 more source
A temporal reachability analysis [PDF]
, 1996 Reachability analysis is the most popular and the most used method in protocol validation. It consists in constructing a graph called reachability graph, describing communication of machines exchanging messages through FIFO channels. The states and structure of this graph are then analysed according to given properties to validate the related ...
Leo Cacciari, Omar Rafiq
openaire +2 more sources
Information and Computation, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Chrobak +2 more
openaire +3 more sources
Using disjoint reachability for parallelization [PDF]
, 2011 . We present a disjoint reachability analysis for Java. Our analysis com-putes extended points-to graphs annotated with reachability states. Each heap node is annotated with a set of reachability states that abstract the reachability of objects ...
Brian Demsky +2 more
core +1 more source