2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.LO2014
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…
cs.LO2013★ 2 cited
On the Expressiveness of TPTL and MTL over ω-Data Words
Claudia Carapelle, Shiguang Feng, Oliver Fernández Gil +1
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this pape…
cs.LO2013
Satisfiability of CTL* with constraints
Claudia Carapelle, Alexander Kartzow, Markus Lohrey
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g.…