activity
20142023
most citedA Robust Class of Data Languages and an Application to Learning

23 citations · 29 across the 6 of their papers we have counts for

collaborators

8 papers

cs.LO2023

Synchronous Agents, Verification, and Blame -- A Deontic View

Karam Kharraz, Shaun Azzopardi, Gerardo Schneider +1

A question we can ask of multi-agent systems is whether the agents' collective interaction satisfies particular goals or specifications, which can be either individual or collectiv…

cs.LO2022

Symbolic Runtime Verification for Monitoring under Uncertainties and Assumptions

Hannes Kallwies, Martin Leucker, Cesar Sanchez

Runtime Verification deals with the question of whether a run of a system adheres to its specification. This paper studies runtime verification in the presence of partial knowledge…

cs.LO2019

Runtime Verification For Timed Event Streams With Partial Information

Martin Leucker, César Sánchez, Torben Scheffel +2

Runtime Verification (RV) studies how to analyze execution traces of a system under observation. Stream Runtime Verification (SRV) applies stream transformations to obtain informat…

cs.SE2019

COST Action IC 1402 ArVI: Runtime Verification Beyond Monitoring -- Activity Report of Working Group 1

Wolfgang Ahrendt, Cyrille Artho, Christian Colombo +9

This report presents the activities of the first working group of the COST Action ArVI, Runtime Verification beyond Monitoring. The report aims to provide an overview of some of th…

cs.FL2018★ 3 cited

TeSSLa: Temporal Stream-based Specification Language

Lukas Convent, Sebastian Hungerecker, Martin Leucker +3

Runtime verification is concerned with monitoring program traces. In particular, stream runtime verification (SRV) takes the program trace as input streams and incrementally derive…

cs.LO2017

Model-checking Counting Temporal Logics on Flat Structures

Normann Decker, Peter Habermehl, Martin Leucker +2

We study several extensions of linear-time and computation-tree temporal logics with quantifiers that allow for counting how often certain properties hold. For most of these extens…

cs.LO2014★ 23 cited

A Robust Class of Data Languages and an Application to Learning

Benedikt Bollig, Peter Habermehl, Martin Leucker +1

We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are w…

cs.LO2014★ 3 cited

Ordered Navigation on Multi-attributed Data Words

Normann Decker, Peter Habermehl, Martin Leucker +1

We study temporal logics and automata on multi-attributed data words. Recently, BD-LTL was introduced as a temporal logic on data words extending LTL by navigation along positions…