Abstract
Randomization is a powerful technique to create robust controllers, in particular in partially observable settings. The degrees of randomization have a significant impact on the system performance, yet they are intricate to get right. The use of synthesis algorithms for parametric Markov chains (pMCs) is a promising direction to support the design process of such controllers. This paper shows how to define and evaluate gradients of pMCs. Furthermore, it investigates varieties of gradient descent techniques from the machine learning community to synthesize the probabilities in a pMC. The resulting method scales to significantly larger pMCs than before and empirically outperforms the state-of-the-art, often by at least one order of magnitude.
Original language | English |
---|---|
Title of host publication | Verification, model Checking, and Abstract Interpretation |
Subtitle of host publication | 23rd International Conference, VMCAI 2022 Philadelphia, PA, USA, January 16–18, 2022 Proceedings |
Editors | Bernd Finkbeiner, Thomas Wies |
Publisher | Springer |
Pages | 127-150 |
Number of pages | 24 |
Edition | 1 |
ISBN (Electronic) | 9783030945831 |
ISBN (Print) | 9783030945824 |
DOIs | |
Publication status | Published - 2022 |
Event | The 23rd international conference Verification, Model Checking, and Abstract Interpretation - Philadelphia, United States Duration: 16 Jan 2022 → 18 Jan 2022 Conference number: 23 https://popl22.sigplan.org/home/VMCAI-2022 https://link.springer.com/book/10.1007/978-3-030-94583-1 |
Publication series
Series | Lecture Notes in Computer Science |
---|---|
Volume | 13182 |
ISSN | 0302-9743 |
Series | Theoretical Computer Science and General Issues (LNCS subseries) |
---|---|
Volume | 13182 |
Conference
Conference | The 23rd international conference Verification, Model Checking, and Abstract Interpretation |
---|---|
Abbreviated title | VMCAI 2022 |
Country/Territory | United States |
City | Philadelphia |
Period | 16/01/22 → 18/01/22 |
Internet address |