44 search results - page 5 / 9 » Model Checking Probabilistic Pushdown Automata |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
117
click to vote
ASIAN
2003
Springer
15 years 5 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
105
click to vote
QEST
2010
IEEE
14 years 9 months ago
2010
IEEE
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
SIGSOFT
2009
ACM
16 years 13 days ago
2009
ACM
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...