101 search results - page 3 / 21 » A New Class of Decidable Hybrid Systems |
HYBRID
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. The algorithmic design of least restrictive controllers for hybrid systems that satisfy reachability specifications has received much attention recently. Despite the imp...
HYBRID
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
STACS
2001
Springer
13 years 10 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
FOSSACS
2001
Springer
13 years 10 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
PODS
2004
ACM
14 years 5 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...