Abstrakt

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 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.
OriginalsprogUdefineret/Ukendt
TidsskriftLogical Methods in Computer Science
Vol/bind17
Udgave nummer1
ISSN1860-5974
DOI
StatusUdgivet - 1 mar. 2021

Emneord

  • Computer Science - Logic in Computer Science

Citationsformater