tacas16.pdf (405.65 kB)
Download file

Probabilistic CTL*: The Deductive Way

Download (405.65 kB)
conference contribution
posted on 30.05.2018, 11:19 by Rayna Dimitrova, Luis María Ferrer Fioriti, Holger Hermanns, Rupak Majumdar
Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the context of families of randomized protocols. At its core, this entails checking infinite-state probabilistic systems with respect to quantitative properties specified in probabilistic temporal logics. Model checking methods are not directly applicable to infinite-state systems, and techniques for infinite-state probabilistic systems are limited in terms of the specifications they can handle. This paper presents a deductive approach to the verification of countable-state systems against properties specified in probabilistic CTL ∗, on models featuring both nondeterministic and probabilistic choices. The deductive proof system we propose lifts the classical proof system by Kesten and Pnueli to the probabilistic setting. However, the soundness arguments are completely distinct and go via the theory of martingales. Completeness results for the finite-state case and an infinite-state example illustrate the effectiveness of our approach.

Funding

This work is supported by the EU FP7 projects 295261 (MEALS) and 318490 (SENSATION), by the DFG Transregional Collaborative Research Centre SFB/TR 14 AVACS, and by the CDZ project 1023 (CAP).

History

Citation

Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2016. Lecture Notes in Computer Science, 2016, 9636

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Informatics

Source

22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS), Eindhoven, NETHERLANDS

Version

AM (Accepted Manuscript)

Published in

Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2016. Lecture Notes in Computer Science

Publisher

Springer-Verlag Berlin

issn

0302-9743

eissn

1611-3349

isbn

978-3-662-49673-2

Copyright date

2016

Available date

30/05/2018

Publisher version

https://link.springer.com/chapter/10.1007/978-3-662-49674-9_16

Editors

Chechik, M.;Raskin, J. F.

Book series

Lecture Notes in Computer Science book series (LNCS);9636

Temporal coverage: start date

02/04/2016

Temporal coverage: end date

08/04/2016

Language

en