Pages that link to "Item:Q868025"
From MaRDI portal
The following pages link to On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025):
Displaying 16 items.
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Expressiveness of hybrid temporal logic on data words (Q2825412) (← links)
- Future-Looking Logics on Data Words and Trees (Q3182936) (← links)
- Some Recent Results in Metric Temporal Logic (Q3543284) (← links)
- Beyond Shapes: Lists with Ordered Data (Q3617745) (← links)
- (Q4611376) (← links)
- (Q4972731) (← links)
- (Q4972736) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)
- (Q5136335) (← links)
- (Q5155690) (← links)
- Optimal run problem for weighted register automata (Q5919052) (← links)
- Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
- Automata and grammars for data words (Q6666782) (← links)