On Zone-Based Analysis of Duration Probabilistic Automata
Abstract
We propose an extension of the zone-based algorithmics for analyzing timed automata to handle systems where timing uncertainty is considered as probabilistic rather than set-theoretic. We study duration probabilistic automata (DPA), expressing multiple parallel processes admitting memoryfull continuously-distributed durations. For this model we develop an extension of the zone-based forward reachability algorithm whose successor operator is a density transformer, thus providing a solution to verification and performance evaluation problems concerning acyclic DPA (or the bounded-horizon behavior of cyclic DPA).
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2010
- DOI:
- 10.48550/arXiv.1011.0219
- arXiv:
- arXiv:1011.0219
- Bibcode:
- 2010arXiv1011.0219M
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory;
- Computer Science - Logic in Computer Science
- E-Print:
- In Proceedings INFINITY 2010, arXiv:1010.6112