25 search results - page 1 / 5 » Model Checking LTL over Controllable Linear Systems Is Decid... |
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
CDC
2009
IEEE
13 years 2 months ago
2009
IEEE
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...