14 citations · 74 across the 41 of their papers we have counts for
4 papers · 1 filter
Path Checking for MTL and TPTL over Data Words
Shiguang Feng, Markus Lohrey, Karin Quaas
Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are quantitative extensions of linear temporal logic, which are prominent and widely used in the verificat…
Satisfiability of ECTL* with tree constraints
Claudia Carapelle, Shiguang Feng, Alexander Kartzow +1
Recently, we have shown that satisfiability for with constraints over is decidable using a new technique. This approach reduces the satisfiability pr…
Constructing small tree grammars and small circuits for formulas
Moses Ganardi, Danny Hucke, Artur Jez +2
It is shown that every tree of size over a fixed set of different ranked symbols can be decomposed (in linear time as well as in logspace) into $O\big(\frac{n}{\log_σn}\big…
Processing Succinct Matrices and Vectors
Markus Lohrey, Manfred Schmidt-Schauss
We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, wher…