Results 121 to 130 of about 24,416 (155)
Some of the next articles are maybe not open access.
A Logical Reconstruction of Reachability
2004In this paper we discuss reachability analysis for infinite-state systems. Infinite-state systems are formalized using transition systems over a first-order structure. We establish a common ground relating a large class of algorithms by analyzing the connections between the symbolic representation of transition systems and formulas used in various ...
Rybina, Tatiana, Voronkov, Andrei
openaire +3 more sources
Reachability in hierarchical machines
Proceedings of the 2014 IEEE 15th International Conference on Information Reuse and Integration (IEEE IRI 2014), 2014In this paper we study the reachability analysis problem for timed systems specified in a hierarchical manner. First we provide a formal model, called hierarchical extended Mealy machine with timer, input and output events, as well with input, output and context variables. Then we present a synchronous semantics of the model.
Omer Nguena-Timo +3 more
openaire +2 more sources
Perceived reachability in hemispace
Brain and Cognition, 2005A common observation in studies of perceived (imagined) compared to actual movement in a reaching paradigm is the tendency to overestimate. Of the studies noted, reaching tasks have been presented in the general midline range. In the present study, strong right-handers were asked to judge the reachability of visual targets projected onto a table ...
Carl, Gabbard +2 more
openaire +2 more sources
2022 IEEE 35th Computer Security Foundations Symposium (CSF), 2022
Sébastien Gondron +2 more
openaire +2 more sources
Sébastien Gondron +2 more
openaire +2 more sources
Reachability under uncertainty
Proceedings of the 41st IEEE Conference on Decision and Control, 2002., 2003The paper studies the problem of reachability for linear systems in the presence of uncertain (unknown but bounded) input disturbances, which may also be interpreted as the action of an adversary in a game-theoretic setting. It defines possible notions of reachability under uncertainty emphasizing the differences between open-loop and closed-loop ...
Alexander B. Kurzhanski, Pravin Varaiya
openaire +2 more sources
On the Hardness of Reachability Reduction
2019A class of reachability reduction problem is raised in the area of computer network security and software engineering. We revisit the reachability reduction problem on vertex labeled graphs in which labels are representing multiple roles. In this paper, reachability reduction is modeled based on a kind of graph cut problem aiming to disconnect those ...
Dongjing Miao, Zhipeng Cai 0001
openaire +2 more sources
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013In this paper we consider the problem of maintaining information about graphs with history -- so called graph timeline. A graph timeline is a sequence of graphs G1,..., Gt, in which consecutive graphs are obtained from previous ones by small modifications, e.g., by adding or removing a single edge.
Jakub Lacki, Piotr Sankowski
openaire +2 more sources
Journal of Dynamic Systems, Measurement, and Control, 1981
Two methods are presented for investigating reachable sets for nonlinear control systems. One method, based on a reachability maximum principle, lacks appropriate boundary conditions if the reachable set is not closed. The main result of the paper is an approximate method employing a Lyapunov-type function and an associated optimization problem, both ...
openaire +1 more source
Two methods are presented for investigating reachable sets for nonlinear control systems. One method, based on a reachability maximum principle, lacks appropriate boundary conditions if the reachable set is not closed. The main result of the paper is an approximate method employing a Lyapunov-type function and an associated optimization problem, both ...
openaire +1 more source
2013
Program verifiers that attempt to verify programs automatically pose the verification problem as the decision problem: Does there exist a proof that establishes the absence of errors? In this paper, we argue that program verification should instead be posed as the following decision problem: Does there exist an execution that establishes the presence ...
Akash Lal, Shaz Qadeer
openaire +1 more source
Program verifiers that attempt to verify programs automatically pose the verification problem as the decision problem: Does there exist a proof that establishes the absence of errors? In this paper, we argue that program verification should instead be posed as the following decision problem: Does there exist an execution that establishes the presence ...
Akash Lal, Shaz Qadeer
openaire +1 more source
Reachability and Expectation in Gossiping
2017We give combinatorial, computational and simulation results for well-known distributed protocols for gossiping on completely connected networks. The protocols consist of: making any call (\(\mathsf {ANY}\)), only calling agents whose secret you do not know (“learn new secrets” \(\mathsf {LNS}\)), and never repeating calls (“call once” \(\mathsf {CO}\)).
Hans van Ditmarsch +2 more
openaire +3 more sources