10 citations · 11 across the 6 of their papers we have counts for
7 papers · 1 filter
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…
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…
Fifty years of Hoare's Logic
Krzysztof R. Apt, Ernst-Ruediger Olderog
We present a history of Hoare's logic.
Symbolic vs. Bounded Synthesis for Petri Games
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch +1
Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic…