Sciweavers

198 search results - page 24 / 40
» Reachability on prefix-recognizable graphs
Sort
View
ICALP
2007
Springer
14 years 4 months ago
On Commutativity Based Edge Lean Search
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
Dragan Bosnacki, Edith Elkind, Blaise Genest, Doro...
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
14 years 3 months ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle
ICALP
2010
Springer
14 years 2 months ago
The Downward-Closure of Petri Net Languages
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
Peter Habermehl, Roland Meyer, Harro Wimmel
AIS
2004
Springer
14 years 1 months ago
Timed I/O Test Sequences for Discrete Event Model Verification
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...
Ki Jung Hong, Tag Gon Kim
CONCUR
2010
Springer
13 years 11 months ago
Parameterized Verification of Ad Hoc Networks
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavat...