Computing Maximal Expected Termination Time of Probabilistic Timed Automata

Omar I. Al-Bataineh
Omar I. Al-Bataineh

arXiv: Formal Languages and Automata Theory, 2017.

Cited by: 0|Bibtex|Views8
Other Links: academic.microsoft.com|arxiv.org

Abstract:

The paper addresses the problem of computing maximal expected to termination of probabilistic timed automata (PTA) models, under the condition that the system will, eventually, terminate. This problem can exhibit high computational complexity, in particular when the automaton under analysis contains cycles that may be repeated very often...More

Code:

Data:

Your rating :
0

 

Tags
Comments