### Abstract

Original language | Undefined |
---|---|

Title of host publication | Proceedings of the 12th International Conference on Integrated Formal Methods (IFM 2016) |

Place of Publication | Berlin |

Publisher | Springer Verlag |

Pages | 99-114 |

Number of pages | 16 |

ISBN (Print) | 978-3-319-33692-3 |

DOIs | |

State | Published - Jun 2016 |

Event | 12th International Conference on integrated Formal Methods 2016 - Reykjavik, Iceland |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer Verlag |

Volume | 9681 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 12th International Conference on integrated Formal Methods 2016 |
---|---|

Abbreviated title | iFM 2016 |

Country | Iceland |

City | Reykjavik |

Period | 1/06/16 → 5/06/16 |

### Fingerprint

### Keywords

- METIS-317210
- EWI-27044
- IR-100708

### Cite this

*Proceedings of the 12th International Conference on Integrated Formal Methods (IFM 2016)*(pp. 99-114). (Lecture Notes in Computer Science; Vol. 9681). Berlin: Springer Verlag. DOI: 10.1007/978-3-319-33693-0_7

}

*Proceedings of the 12th International Conference on Integrated Formal Methods (IFM 2016).*Lecture Notes in Computer Science, vol. 9681, Springer Verlag, Berlin, pp. 99-114, 12th International Conference on integrated Formal Methods 2016, Reykjavik, Iceland, 1-5 June. DOI: 10.1007/978-3-319-33693-0_7

**Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata.** / d' Argenio, P.R.; Hartmanns, Arnd; Legay, A.; Sedwards, S.

Research output: Scientific - peer-review › Conference contribution

TY - CHAP

T1 - Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

AU - d' Argenio,P.R.

AU - Hartmanns,Arnd

AU - Legay,A.

AU - Sedwards,S.

N1 - eemcs-eprint-27044

PY - 2016/6

Y1 - 2016/6

N2 - The verification of probabilistic timed automata involves finding schedulers that optimise their nondeterministic choices with respect to the probability of a property. In practice, approaches based on model checking fail due to state-space explosion, while simulation-based techniques like statistical model checking are not applicable due to the nondeterminism. We present a new lightweight on-the-fly algorithm to find near-optimal schedulers for probabilistic timed automata. We make use of the classical region and zone abstractions from timed automata model checking, coupled with a recently developed smart sampling technique for statistical verification of Markov decision processes. Our algorithm provides estimates for both maximum and minimum probabilities. We compare our new approach with alternative techniques, first using tractable examples from the literature, then motivate its scalability using case studies that are intractable to numerical model checking and challenging for existing statistical techniques.

AB - The verification of probabilistic timed automata involves finding schedulers that optimise their nondeterministic choices with respect to the probability of a property. In practice, approaches based on model checking fail due to state-space explosion, while simulation-based techniques like statistical model checking are not applicable due to the nondeterminism. We present a new lightweight on-the-fly algorithm to find near-optimal schedulers for probabilistic timed automata. We make use of the classical region and zone abstractions from timed automata model checking, coupled with a recently developed smart sampling technique for statistical verification of Markov decision processes. Our algorithm provides estimates for both maximum and minimum probabilities. We compare our new approach with alternative techniques, first using tractable examples from the literature, then motivate its scalability using case studies that are intractable to numerical model checking and challenging for existing statistical techniques.

KW - METIS-317210

KW - EWI-27044

KW - IR-100708

U2 - 10.1007/978-3-319-33693-0_7

DO - 10.1007/978-3-319-33693-0_7

M3 - Conference contribution

SN - 978-3-319-33692-3

T3 - Lecture Notes in Computer Science

SP - 99

EP - 114

BT - Proceedings of the 12th International Conference on Integrated Formal Methods (IFM 2016)

PB - Springer Verlag

ER -