25 search results - page 1 / 5 » Algorithmic Metatheorems for Decidable LTL Model Checking ov... |
108
Voted
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
155
Voted
HYBRID
2003
Springer
15 years 9 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...
134
Voted
FOSSACS
2008
Springer
15 years 5 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...
166
Voted
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
132
Voted
FSTTCS
2006
Springer
15 years 7 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...