198 search results - page 10 / 40 » Reachability on prefix-recognizable graphs |
ACSD
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
FSEN
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
AIPS
2006
13 years 11 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
AI
2008
Springer
13 years 10 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
STACS
1994
Springer
14 years 1 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...