Sciweavers

12 search results - page 1 / 3
» An Algorithm for the Approximative Analysis of Rectangular A...
Sort
View
FTRTFT
1998
Springer
13 years 9 months ago
An Algorithm for the Approximative Analysis of Rectangular Automata
Jörg Preußig, Stefan Kowalewski, Howard...
TALG
2010
86views more  TALG 2010»
13 years 3 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
HYBRID
1999
Springer
13 years 9 months ago
A New Class of Decidable Hybrid Systems
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...
HYBRID
2003
Springer
13 years 10 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
TALG
2010
101views more  TALG 2010»
13 years 3 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert