44 search results - page 4 / 9 » Model Checking Probabilistic Pushdown Automata |
103
Voted
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
106
click to vote
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
102
Voted
QEST
2008
IEEE
15 years 6 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
106
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
123
click to vote
PE
2011
Springer
14 years 6 months ago
2011
Springer
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...