3 citations · 6 across the 4 of their papers we have counts for
5 papers
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].
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…
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…
On Freeze LTL with Ordered Attributes
Normann Decker, Daniel Thoma
This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and…
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…