76 search results - page 15 / 16 » Weak Alternating Automata and Tree Automata Emptiness |
CAV
2005
Springer
14 years 1 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
ARCS
2008
Springer
13 years 9 months ago
2008
Springer
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountabl...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...