9 search results - page 2 / 2 » Reachability Problems in Piecewise FIFO Systems |
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
SIAMCO
2002
13 years 5 months ago
2002
The paper studies the problem of reachability for linear systems in the presence of uncertain input disturbances that may also be interpreted as the action of an adversary in a ga...
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...