Sciweavers

6 search results - page 1 / 2
» Model Checking Freeze LTL over One-Counter Automata
Sort
View
FOSSACS
2008
Springer
13 years 6 months ago
Model Checking Freeze LTL over One-Counter Automata
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...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
ICALP
2010
Springer
13 years 9 months ago
Model Checking Succinct and Parametric One-Counter Automata
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
Stefan Göller, Christoph Haase, Joël Oua...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 4 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
HYBRID
2003
Springer
13 years 9 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
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...
Paulo Tabuada, George J. Pappas