44 search results - page 6 / 9 » Model Checking Probabilistic Pushdown Automata |
113
click to vote
FORMATS
2003
Springer
15 years 4 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
111
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
CONCUR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
115
click to vote
CAV
2006
Springer
15 years 3 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...