AbstractWe present several constructions and techniques which have recently been used to tackle the prob- lems of qualitative/quantitative analysis of probabilistic pushdown automata
Properties of probabilistic as well as ``probabilistic plus nondeterministic'' pushdown automata and...
Quantitative model checking is concerned with the verification of both quantitative and qualitative ...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdo...
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...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
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...
Automata with monitor counters, where the transitions do not depend on counter values, and nested we...
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Mark...
Probabilistic pushdown automata (recursive state machines) are a widely known model of probabilistic...
Abstract. We show that several basic discounted properties of probabilistic pushdown automata relate...
Probabilistic (or quantitative) verification is a branch of formal methods dealing with stochastic m...
AbstractProperties of (unbounded-error) probabilistic as well as “probabilistic plus nondeterministi...
Properties of probabilistic as well as ``probabilistic plus nondeterministic'' pushdown automata and...
Quantitative model checking is concerned with the verification of both quantitative and qualitative ...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdo...
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...
Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic pro...
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...
Automata with monitor counters, where the transitions do not depend on counter values, and nested we...
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Mark...
Probabilistic pushdown automata (recursive state machines) are a widely known model of probabilistic...
Abstract. We show that several basic discounted properties of probabilistic pushdown automata relate...
Probabilistic (or quantitative) verification is a branch of formal methods dealing with stochastic m...
AbstractProperties of (unbounded-error) probabilistic as well as “probabilistic plus nondeterministi...
Properties of probabilistic as well as ``probabilistic plus nondeterministic'' pushdown automata and...
Quantitative model checking is concerned with the verification of both quantitative and qualitative ...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
DOI
Add to ORKG