activity
20092023
most citedPetri Games: Synthesis of Distributed Systems with Causal Memory

12 citations · 31 across the 14 of their papers we have counts for

collaborators

14 papers

cs.PL2023

Nondeterminism and Guarded Commands

Krzysztof R. Apt, Ernst-Rüdiger Olderog

The purpose of this paper is to discuss the relevance of nondeterminism in computer science, with a special emphasis on Dijkstra's guarded commands language.

cs.LO2023

Concurrent Hyperproperties

Bernd Finkbeiner, Ernst-Rüdiger Olderog

Trace properties, which are sets of execution traces, are often used to analyze systems, but their expressiveness is limited. Clarkson and Schneider defined hyperproperties as a ge…

cs.LO2021

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…

cs.LO2020

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…

cs.LO2020★ 1 cited

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…

cs.LO2019★ 5 cited

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…