Partial order reduction for reachability games
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 …
systems and practical applications of the technique show nontrivial reduction in the size of …
Stubborn set reduction for two-player reachability games
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 …
systems and practical applications of the technique show nontrivial reduction in the size of …
Automatic synthesis of transiently correct network updates via petri games
M Didriksen, PG Jensen, JF Jønler, AI Katona… - … on Applications and …, 2021 - Springer
As software-defined networking (SDN) is growing increasingly common within the
networking industry, the lack of accessible and reliable automated methods for updating …
networking industry, the lack of accessible and reliable automated methods for updating …
Kaki: Concurrent update synthesis for regular policies via petri games
Modern computer networks are becoming increasingly complex and for dependability
reasons require frequent configuration changes. It is essential that forwarding policies are …
reasons require frequent configuration changes. It is essential that forwarding policies are …
Discrete and continuous strategies for timed-arc Petri net games
Automatic strategy synthesis for a given control objective can be used to generate correct-by-
construction controllers of real-time reactive systems. The existing symbolic approach for …
construction controllers of real-time reactive systems. The existing symbolic approach for …
Playing Wordle with Uppaal Stratego
In this paper we model and solve the popular game Wordle using Uppaal Stratego. We
model three different game-modes in terms of POMDPs, with more than 12,000 controllable …
model three different game-modes in terms of POMDPs, with more than 12,000 controllable …
Kaki: Efficient Concurrent Update Synthesis for SDN
Modern computer networks based on the software-defined networking (SDN) paradigm are
becoming increasingly complex and often require frequent configuration changes in order to …
becoming increasingly complex and often require frequent configuration changes in order to …
Synthesis of asynchronous distributed systems from global specifications
J Hecking-Harbusch - 2021 - publikationen.sulb.uni-saarland.de
The synthesis problem asks whether there exists an implementation for a given formal
specification and derives such an implementation if it exists. This approach enables …
specification and derives such an implementation if it exists. This approach enables …
Timed arc Petri nets: The time-element approach
In this work, a novel model is proposed for Deterministic Timed Arc Petri Nets. In the
proposed Timed Arc Petri Net, transition firing processes are associated with time, where …
proposed Timed Arc Petri Net, transition firing processes are associated with time, where …
Stubborn Set Reduction for Timed Reachability and Safety Games
Timed games are an essential formalism for modeling time-sensitive reactive systems that
must respond to uncontrollable events triggered by the (hostile) environment. However, the …
must respond to uncontrollable events triggered by the (hostile) environment. However, the …