Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2019.23
URN: urn:nbn:de:0030-drops-109251
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10925/
Bønneland, Frederik Meyer ; Jensen, Peter Gjøl ; Larsen, Kim G. ; Muñiz, Marco ; Srba, Jirí
Partial Order Reduction for Reachability Games
| pdf-format: |
|
Abstract
Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability/safety objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.
BibTeX - Entry
@InProceedings{bnneland_et_al:LIPIcs:2019:10925,
author = {Frederik Meyer B{\o}nneland and Peter Gj{\o}l Jensen and Kim G. Larsen and Marco Mu{\~n}iz and Jir{\'\i} Srba},
title = {{Partial Order Reduction for Reachability Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Wan Fokkink and Rob van Glabbeek},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10925},
URN = {urn:nbn:de:0030-drops-109251},
doi = {10.4230/LIPIcs.CONCUR.2019.23},
annote = {Keywords: Petri nets, games, synthesis, partial order reduction, stubborn sets}
}
| Keywords: | Petri nets, games, synthesis, partial order reduction, stubborn sets | |
| Seminar: | 30th International Conference on Concurrency Theory (CONCUR 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 20.08.2019 |
