Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1361123
- scientific article; zbMATH DE number 4113945
- Stochastic Real-Time Games with Qualitative Timed Automata Objectives
- Bounded synthesis for Petri games
- scientific article; zbMATH DE number 2088660
- Synthesis of bounded integer parameters for parametric timed reachability games
- scientific article; zbMATH DE number 1696456
- Tools and Algorithms for the Construction and Analysis of Systems
- Canonical representations for direct generation of strategies in high-level Petri games
Cited in
(10)- TAPAAL
- Automatic synthesis of transiently correct network updates via Petri games
- Kaki: concurrent update synthesis for regular policies via Petri games
- Verification and performance evaluation of timed game strategies
- Stubborn set reduction for two-player reachability games
- Partial order reduction for reachability games
- Security-aware synthesis using delayed-action games
- Kaki: efficient concurrent update synthesis for SDN
- On-the-fly verification: advancements in dependency graphs (invited talk)
- Stubborn set reduction for timed reachability and safety games
This page was built for publication: Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814624)