10 citations · 12 across the 7 of their papers we have counts for
8 papers
Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory (Full Version)
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch +1
In the synthesis of distributed systems, we automate the development of distributed programs and hardware by automatically deriving correct implementations from formal specificatio…
A Web Interface for Petri Nets with Transits and Petri Games
Manuel Gieseking, Jesko Hecking-Harbusch, Ann Yanich
Developing algorithms for distributed systems is an error-prone task. Formal models like Petri nets with transits and Petri games can prevent errors when developing such algorithms…
Canonical Representations for Direct Generation of Strategies in High-level Petri Games (Full Version)
Manuel Gieseking, Nick Würdemann
Petri games are a multi-player game model for the synthesis problem in distributed systems, i.e., the automatic generation of local controllers. The model represents causal memory…
Model Checking Branching Properties on Petri Nets with Transits (Full Version)
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch +1
To model check concurrent systems, it is convenient to distinguish between the data flow and the control. Correctness is specified on the level of data flow whereas the system is c…
AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL (Full Version)
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch +1
The correctness of networks is often described in terms of the individual data flow of components instead of their global behavior. In software-defined networks, it is far more con…
Model Checking Data Flows in Concurrent Network Updates (Full Version)
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch +1
We present a model checking approach for the verification of data flow correctness in networks during concurrent updates of the network configuration. This verification problem is…