Add to ORKGAbstract. We show that several basic discounted properties of probabilistic pushdown automata related both to terminating and non-terminating runs can be efficiently approximated up to an arbitrarily small given precision.
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdo...
International audienceComputing the reachability probability in infinite state probabilistic models ...
We begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a p...
AbstractWe study the most important probabilistic computation modes for pushdown automata. First we ...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
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...
Properties of probabilistic as well as ``probabilistic plus nondeterministic'' pushdown automata and...
AbstractWe present several constructions and techniques which have recently been used to tackle the ...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA)and subclasses thereof. ...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata ...
AbstractIn this paper we study complexity of the model-checking problem for probabilistic pushdown a...
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdo...
International audienceComputing the reachability probability in infinite state probabilistic models ...
We begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a p...
AbstractWe study the most important probabilistic computation modes for pushdown automata. First we ...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
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...
Properties of probabilistic as well as ``probabilistic plus nondeterministic'' pushdown automata and...
AbstractWe present several constructions and techniques which have recently been used to tackle the ...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA)and subclasses thereof. ...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata ...
AbstractIn this paper we study complexity of the model-checking problem for probabilistic pushdown a...
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdo...
International audienceComputing the reachability probability in infinite state probabilistic models ...
We begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a p...