88 search results - page 6 / 18 » Functional Reachability |
FORMATS
2010
Springer
13 years 5 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...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
FPCA
1995
13 years 11 months ago
1995
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be div...
FMCAD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...