State explosion in almost-sure probabilistic reachability

Authors:
François Laroussinie;Jeremy Sproston
Affiliations:
Lab. Spécification & Véérification, ENS de Cachan & CNRS UMR 8643, 61, av. Pdt. Wilson, 94235 Cachan Cedex, France;Dipartimento di Informatica, Università di Torino, 10149 Torino, Italy
Venue:
Information Processing Letters
Year:
2007

Citing 11
Cited 5

A theory of timed automata

Theoretical Computer Science
The complexity of probabilistic verification

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Model checking

Model checking
Termination of Probabilistic Concurrent Program

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic verification of real-time systems with discrete probability distributions

Theoretical Computer Science
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Model checking for probability and time: from theory to practice

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Probabilistic propositional planning: representations and complexity

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
PRISM: a tool for automatic verification of probabilistic systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

EXPTIME-complete Decision Problems for Modal and Mixed Specifications

Electronic Notes in Theoretical Computer Science (ENTCS)
Concavely-Priced Probabilistic Timed Automata

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Strict Divergence for Probabilistic Timed Automata

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Modal and mixed specifications: Key decision problems and their complexities

Mathematical Structures in Computer Science
Model checking probabilistic timed automata with one or two clocks

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.90

Visualization

Abstract

We show that the problem of reaching a state set with probability 1 in probabilistic-nondeterministic systems operating in parallel is EXPTIME-complete. We then show that this probabilistic reachability problem is EXPTIME-complete also for probabilistic timed automata.