activity
20112025
most citedVerifying Hyperliveness

66 citations · 568 across the 83 of their papers we have counts for

collaborators
Showing 2020Show all

14 papers · 1 filter

cs.LO2020★ 3 cited

Synthesizing Approximate Implementations for Unrealizable Specifications

Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah

The unrealizability of a specification is often due to the assumption that the behavior of the environment is unrestricted. In this paper, we present algorithms for synthesis in bo…

cs.FL2020★ 2 cited

Approximate Automata for Omega-Regular Languages

Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah

Automata over infinite words, also known as omega-automata, play a key role in the verification and synthesis of reactive systems. The spectrum of omega-automata is defined by two…

cs.FL2020★ 13 cited

Canonical Representations of k-Safety Hyperproperties

Bernd Finkbeiner, Lennart Haas, Hazem Torfah

Hyperproperties elevate the traditional view of trace properties form sets of traces to sets of sets of traces and provide a formalism for expressing information-flow policies. For…

cs.LO2020★ 7 cited

Explainable Reactive Synthesis

Tom Baumeister, Bernd Finkbeiner, Hazem Torfah

Reactive synthesis transforms a specification of a reactive system, given in a temporal logic, into an implementation. The main advantage of synthesis is that it is automatic. The…

cs.SE2020

Verified Rust Monitors for Lola Specifications

Bernd Finkbeiner, Stefan Oswald, Noemi Passing +1

The safety of cyber-physical systems rests on the correctness of their monitoring mechanisms. This is problematic if the specification of the monitor is implemented manually or int…

cs.LO2020★ 2 cited

Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity

Jonni Virtema, Jana Hofmann, Bernd Finkbeiner +2

We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining…

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

Dependency-based Compositional Synthesis (Full Version)

Bernd Finkbeiner, Noemi Passing

Despite many recent advances, reactive synthesis is still not really a practical technique. The grand challenge is to scale from small transition systems, where synthesis performs…

cs.LO2020★ 66 cited

Verifying Hyperliveness

Norine Coenen, Bernd Finkbeiner, César Sánchez +1

HyperLTL is an extension of linear-time temporal logic for the specification of hyperproperties, i.e., temporal properties that relate multiple computation traces. HyperLTL can exp…

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.LO2020★ 38 cited

The Hierarchy of Hyperlogics

Norine Coenen, Bernd Finkbeiner, Christopher Hahn +1

Hyperproperties, which generalize trace properties by relating multiple traces, are widely studied in information-flow security. Recently, a number of logics for hyperproperties ha…

cs.LO2020

Probabilistic Hyperproperties of Markov Decision Processes

Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah

Hyperproperties are properties that describe the correctness of a system as a relation between multiple executions. Hyperproperties generalize trace properties and include informat…

cs.RO2020

RTLola Cleared for Take-Off: Monitoring Autonomous Aircraft

Jan Baumeister, Bernd Finkbeiner, Sebastian Schirmer +2

The autonomous control of unmanned aircraft is a highly safety-critical domain with great economic potential in a wide range of application areas, including logistics, agriculture,…

cs.LO2020★ 4 cited

Teaching Temporal Logics to Neural Networks

Christopher Hahn, Frederik Schmitt, Jens U. Kreber +2

We study two fundamental questions in neuro-symbolic computing: can deep learning tackle challenging problems in logics end-to-end, and can neural networks learn the semantics of l…