3 papers
cs.LO2020
On the Complexity of Linear Temporal Logic with Team Semantics
Martin Lück
A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are…
cs.LO2016
Axiomatizations of Team Logics
Martin Lück
In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obta…
cs.LO2015
LTL Fragments are Hard for Standard Parameterisations
Martin Lück, Arne Meier
We classify the complexity of the LTL satisfiability and model checking problems for several standard parameterisations. The investigated parameters are temporal depth, number of p…