We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this probabilistic reachability problem is EXPTIME-complete also for probabilistic timed automata. Key words: probabilistic systems, model checking, computational complexity, formal methods, timed automata
Probabilistic automata (p.a.) are a generalization of finite deterministic automata. We follow the f...
Abstract. Given a parametric Markov model, we consider the problem of computing the rational functio...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
Abstract. We study the maximal reachability probability problem for infinite-state systems featuring...
This paper continues our study of the verification problem for infinite-state systems featuring both...
Probabilistic timed automata are an extension of timed automata with discreteprobability distributio...
Probabilistic timed automata are an extension of timed automata with discrete probability distributi...
Probabilistic timed automata (PTAs) are used for formal modelling and verifi-cation of systems with ...
We study the maximal reachability probability problem for infinite-state systems featuring both non...
The ability to provide succinct information about why a property does, or does not, hold in a given ...
Probabilistic timed automata are an extension of timed automata with discrete probability distributi...
We consider qualitative and quantitative verification problems forinfinite-state Markov chains. We c...
AbstractWe propose a model of probabilistic timed automaton which substitutes for the non-determinis...
Abstract. This paper investigates relative precision and optimality of analyses for concurrent proba...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
Probabilistic automata (p.a.) are a generalization of finite deterministic automata. We follow the f...
Abstract. Given a parametric Markov model, we consider the problem of computing the rational functio...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
Abstract. We study the maximal reachability probability problem for infinite-state systems featuring...
This paper continues our study of the verification problem for infinite-state systems featuring both...
Probabilistic timed automata are an extension of timed automata with discreteprobability distributio...
Probabilistic timed automata are an extension of timed automata with discrete probability distributi...
Probabilistic timed automata (PTAs) are used for formal modelling and verifi-cation of systems with ...
We study the maximal reachability probability problem for infinite-state systems featuring both non...
The ability to provide succinct information about why a property does, or does not, hold in a given ...
Probabilistic timed automata are an extension of timed automata with discrete probability distributi...
We consider qualitative and quantitative verification problems forinfinite-state Markov chains. We c...
AbstractWe propose a model of probabilistic timed automaton which substitutes for the non-determinis...
Abstract. This paper investigates relative precision and optimality of analyses for concurrent proba...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
Probabilistic automata (p.a.) are a generalization of finite deterministic automata. We follow the f...
Abstract. Given a parametric Markov model, we consider the problem of computing the rational functio...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
DOI
Add to ORKG