Results 111 to 120 of about 24,416 (155)

Reachability and reverse reachability analysis of CFSMs

Computer Communications, 1996
Reachability analysis and the recently proposed reverse reachability analysis are two important verification techniques for communicating finite state machines (CFSM). The issue of the relative efficiency of reachability analysis and reverse reachability analysis is still unsettled.
Wuxu Peng, Kia Makki
openaire   +2 more sources

Reachable Moment

Image: the Journal of Nursing Scholarship, 1999
If thou art one to whom petition is made, be calm as thou listenest to the petitioner's speech. Do not rebuff him before he has swept out his body or before he has said that for which he came. A petitioner likes attention to his words better than the fulfilling of that for which he came… It is not [necessary] that everything about which he has ...
openaire   +2 more sources

Reachable Sets for Tracking

Operations Research, 1974
In many aircraft-tracking systems the following problem is of importance in correlating radar returns with tracks: Given the aircraft position and velocity at time t − Δt and the limits on the ability of the aircraft to maneuver and/or change speed, what is the set of all possible aircraft positions at time t?
Peter J. Wong, Andrew J. Korsak
openaire   +3 more sources

On Reachability Under Uncertainty

SIAM Journal on Control and Optimization, 2002
The reachability for the linear systems with unknown but bounded input disturbances are investigated. These kind of uncertain disturbances may be interpreted as the action of an adversary in a game-theoretic setting. Differences between the reachability upon open loop and closed loop control is characterized. Solution schemes are indicated for ``maxmin'
Alexander B. Kurzhanski, Pravin Varaiya
openaire   +3 more sources

On Reachable Assignments in Cycles

2021
The efficient and fair distribution of indivisible resources among agents is a common problem in the field of Multi-Agent-Systems. We consider a graph-based version of this problem called Reachable Assignment, introduced by Gourves, Lesca, and Wilczynski [IJCAI, 2017].
Luis Müller, Matthias Bentert
openaire   +1 more source

The Reachable Simulation Problem

ACM Transactions on Computational Logic
We investigate the problem of computing the reachable blocks of the simulation equivalence and its natural counterpart for the simulation preorder, referred to as the reachable simulation problem . Through a theoretical investigation of this problem, we unveil a sharp contrast with the already settled case of ...
Pierre Ganty   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy