Sciweavers

1887 search results - page 12 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
STTT
2010
120views more  STTT 2010»
13 years 2 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
HYBRID
2007
Springer
14 years 1 months ago
A Partial Order Approach to Discrete Dynamic Feedback in a Class of Hybrid Systems
Abstract. We consider the dynamic feedback problem in a class of hybrid systems modeled as (infinite) state deterministic transition systems, in which the continuous variables are...
Domitilla Del Vecchio
JCO
2006
150views more  JCO 2006»
13 years 7 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson
CVPR
2004
IEEE
14 years 9 months ago
Propagation Networks for Recognition of Partially Ordered Sequential Action
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activi...
Yifan Shi, Yan Huang, David Minnen, Aaron F. Bobic...
STTT
2010
97views more  STTT 2010»
13 years 6 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...