8 citations · 18 across the 10 of their papers we have counts for
Showing 2014 · cs.LOShow all
3 papers · 2 filters
cs.LO2014
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…
cs.LO2014★ 8 cited
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
Karin Quaas
Parametric timed automata extend timed automata (Alur and Dill, 1991) in that they allow the specification of parametric bounds on the clock values. Since their introduction in 199…
cs.LO2014★ 2 cited
Verification for Timed Automata extended with Unbounded Discrete Data Structures
Karin Quaas
We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. I…