1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.LO2020
Erratum to "Frequency Linear-time Temporal Logic"
Benedikt Bollig, Normann Decker, Martin Leucker
We correct our proof of a theorem stating that satisfiability of frequency linear-time temporal logic is undecidable [TASE 2012].
cs.LO2019★ 1 cited
Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic
Normann Decker, Anton Pirogov
This paper presents an approximation approach to verifying counter systems with respect to properties formulated in an expressive counting extension of linear temporal logic. It ca…
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…