Sciweavers

353 search results - page 8 / 71
» From graph states to two-graph states
Sort
View
FSTTCS
1998
Springer
14 years 2 days ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
AIPS
2000
13 years 9 months ago
Planning with Reduced Operator Sets
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
Patrik Haslum, Peter Jonsson
CONCUR
2010
Springer
13 years 9 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...
IPPS
2005
IEEE
14 years 1 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Zhenyu Xu, Pradip K. Srimani
SCAM
2003
IEEE
14 years 1 months ago
Improving the Static Analysis of Loops by Dynamic Partitioning Techniques
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
Matthieu Martel