14 search results - page 2 / 3 » The Simple Reachability Problem in Switch Graphs |
FORMATS
2010
Springer
13 years 7 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
PLDI
2004
ACM
14 years 3 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
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...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
AUSAI
2005
Springer
14 years 3 months ago
2005
Springer
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...