Sciweavers

2346 search results - page 260 / 470
» Hierarchical State Machines
Sort
View
AIPS
2004
15 years 8 months ago
Complexity of Planning with Partial Observability
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
Jussi Rintanen
FORTE
1998
15 years 8 months ago
Exploiting Symmetry in Protocol Testing
Test generation and execution are often hampered by the large state spaces of the systems involved. In automata (or transition system) based test algorithms, taking advantage of s...
Judi Romijn, Jan Springintveld
PODC
2010
ACM
15 years 6 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
DI
2007
81views more  DI 2007»
15 years 6 months ago
Using every part of the buffalo in Windows memory analysis
All Windows memory analysis techniques depend on the examiner’s ability to translate the virtual addresses used by programs and operating system components into the true locatio...
Jesse D. Kornblum
JSA
2008
131views more  JSA 2008»
15 years 6 months ago
Formal verification of ASMs using MDGs
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...
Amjad Gawanmeh, Sofiène Tahar, Kirsten Wint...