Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization

Jensen, Peter Gjøl; Larsen, Kim Guldstrand; Srba, Jǐŕı

doi:10.1007/978-3-319-32582-8_9

Cited by 9 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We extend the Petri net verification engine verifypn [15], a part of the TAPAAL tool suite [8], to experimentally demonstrate the viability of our approach. The synthesis algorithm for solving Petri net games is an adaptation of the dependency graph fixed-point computation from [18,17] that we reimplement in C++ while utilising PTries [16] for efficient state storage. The source code is available under GPLv3 [4].…”

Section: Implementation and Experimentsmentioning

confidence: 99%

“…We propose approximate syntax-driven conditions of a stable Petri net game reduction satisfying the sufficient conditions for our stable reductions and demonstrate their applicability in an efficient, open source implementation in the model checker TAPAAL [8]. Our implementation is based on dependency graphs, following the approach from [7,17], and we demonstrate on several case studies that the computation of the stubborn sets only has a minor overhead while having the potential of achieving exponential reduction both in the running time as well as in the number of searched configurations. To the best of our knowledge, this is the first efficient implementation of a 2-player game partial order reduction technique for Petri nets games.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Stubborn Set Reduction for Two-Player Reachability Games

Bønneland,

Jensen,

Larsen

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Implementation and Experimentsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Stubborn Set Reduction for Two-Player Reachability Games

Bønneland,

Jensen,

Larsen

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…We believe that those results are also interesting on their own. Note that it is possible to solve discrete-time games by enumerative techniques [25]; however, our algorithms require representing complex sets of states, so being able to solve a given game is not sufficient, and we do need some form of succinct representation.…”

Section: Introductionmentioning

confidence: 99%

Admissible Strategies in Timed Games

Basset

Raskin

Sankur

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we study the notion of admissibility in timed games. First, we show that admissible strategies may not exist in timed games with a continuous semantics of time, even for safety objectives. Second, we show that the discrete time semantics of timed games is better behaved w.r.t. admissibility: the existence of admissible strategies is guaranteed in that semantics. Third, we provide symbolic algorithms to solve the modelchecking problem under admissibility and the assume-admissible synthesis problem for real-time non-zero sum n-player games for safety objectives.

show abstract