44 search results - page 1 / 9 » Model Checking Probabilistic Pushdown Automata |
LMCS
2006
13 years 4 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
CONCUR
1997
Springer
13 years 9 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...