The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdown automata and their subclasses.V článku je podán přehled známých výsledků o pravděpodobnostních zásobníkových automatech a některých jejich podtřídách
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata ...
Soon after the birth of the flourishing research area of model checking in the early eighties, resea...
AbstractWe present several constructions and techniques which have recently been used to tackle the ...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
AbstractProperties of (unbounded-error) probabilistic as well as “probabilistic plus nondeterministi...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
The content of the dissertation falls in the area of formal verification of probabilistic systems. I...
AbstractWe study the most important probabilistic computation modes for pushdown automata. First we ...
Properties of probabilistic as well as ``probabilistic plus nondeterministic'' pushdown automata and...
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Mark...
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
We investigate the problem of evaluating memory consumption for systems modelled by probabilistic pu...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
Soon after the birth of the flourishing research area of model checking in the early eighties, resea...
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata ...
Soon after the birth of the flourishing research area of model checking in the early eighties, resea...
AbstractWe present several constructions and techniques which have recently been used to tackle the ...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
AbstractProperties of (unbounded-error) probabilistic as well as “probabilistic plus nondeterministi...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
The content of the dissertation falls in the area of formal verification of probabilistic systems. I...
AbstractWe study the most important probabilistic computation modes for pushdown automata. First we ...
Properties of probabilistic as well as ``probabilistic plus nondeterministic'' pushdown automata and...
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Mark...
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
We investigate the problem of evaluating memory consumption for systems modelled by probabilistic pu...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
Soon after the birth of the flourishing research area of model checking in the early eighties, resea...
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata ...
Soon after the birth of the flourishing research area of model checking in the early eighties, resea...
DOI
Add to ORKG