Sciweavers

575 search results - page 42 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
CAV
1994
Springer
113views Hardware» more  CAV 1994»
15 years 4 months ago
A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
Rajeev Alur, Limor Fix, Thomas A. Henzinger
IROS
2008
IEEE
138views Robotics» more  IROS 2008»
15 years 6 months ago
Blended local planning for generating safe and feasible paths
Abstract— Many planning approaches adhere to the twotiered architecture consisting of a long-range, low fidelity global planner and a short-range high fidelity local planner. W...
Ling Xu, Anthony Stentz
CG
2007
Springer
14 years 12 months ago
Fast continuous collision detection among deformable models using graphics processors
We present an interactive algorithm to perform continuous collision detection between general deformable models using graphics processors (GPUs). We model the motion of each objec...
Naga K. Govindaraju, Ilknur Kabul, Ming C. Lin, Di...
FORTE
2004
15 years 1 months ago
Witness and Counterexample Automata for ACTL
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
Robert Meolic, Alessandro Fantechi, Stefania Gnesi
LATIN
2010
Springer
14 years 10 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese