Recently, Haase, Ouaknine, and Worrell have shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter automata. We show that reachability in bounded one-counter automata is PSPACE-complete
In a reachability-time game, players Min and Max choose moves so that the time to reach a final stat...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
We study timed systems in which some timing features are unknown parameters.Parametric timed automat...
This paper establishes a relationship between reachability problems in timed automata and space-boun...
Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed...
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this p...
AbstractWe consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augme...
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this p...
Control of timed systems has become a very active re-search area. In this paper, we revisit the comp...
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks au...
Abstract. We study the decidability and complexity of the reachability problem in parametric timed a...
AbstractA discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has...
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been sh...
Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative ...
Abstract. We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill ti...
In a reachability-time game, players Min and Max choose moves so that the time to reach a final stat...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
We study timed systems in which some timing features are unknown parameters.Parametric timed automat...
This paper establishes a relationship between reachability problems in timed automata and space-boun...
Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed...
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this p...
AbstractWe consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augme...
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this p...
Control of timed systems has become a very active re-search area. In this paper, we revisit the comp...
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks au...
Abstract. We study the decidability and complexity of the reachability problem in parametric timed a...
AbstractA discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has...
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been sh...
Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative ...
Abstract. We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill ti...
In a reachability-time game, players Min and Max choose moves so that the time to reach a final stat...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
We study timed systems in which some timing features are unknown parameters.Parametric timed automat...
DOI
Add to ORKG