Results 131 to 140 of about 24,416 (155)

Reachability Problems: An Update

2007
There has been a great deal of progress in the fifteen years that have elapsed since Wigderson published his survey on the complexity of the graph connectivity problem [Wig92]. Most significantly, Reingold solved the longstanding question of the complexity of the s-tconnectivity problem in undirected graphs, showing that this is complete for logspace ...
openaire   +2 more sources

Reachable Set Methods

1981
Differential games provide a systematic framework for solving dynamic problems involving conflict or cooperation. Their solution, however, requires the solution of a two point boundary value problem which is usually too difficult to solve in real time or even off-line.
openaire   +2 more sources

Set Propagation Techniques for Reachability Analysis

Annual Review of Control, Robotics, and Autonomous Systems, 2021
Antoine Girard, Göran Frehse, Matthias Althoff   +2 more
exaly  

Fast Graph Simplification for Interleaved-Dyck Reachability

ACM Transactions on Programming Languages and Systems, 2022
Thomas Reps, Yuanbo Li, Qirun Zhang
exaly  

Set reachability of Markovian jump Boolean networks and its applications

IET Control Theory and Applications, 2020
Biao Wang, Jun-E Feng
exaly  

Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs

IEEE Transactions on Automatic Control, 2021
Ziyue Ma, Guanghui Zhu, Zhiwu Li
exaly  

Controllability and reachability criteria for switched linear systems

Automatica, 2002
Zhendong Sun, S S Ge, T H Lee
exaly  

An Algorithm for the General Petri Net Reachability Problem

SIAM Journal on Computing, 1984
Ernst Mayr
exaly  

Reachability Properties of Continuous-Time Positive Systems

IEEE Transactions on Automatic Control, 2009
Maria Elena Valcher
exaly  

Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem

IEEE Transactions on Automatic Control, 2017
Ziyue Ma, Alessandro Giua, Zhiwu Li
exaly