The Complexity of Flat Freeze LTL
From MaRDI portal
Publication:5111647
DOI10.4230/LIPIcs.CONCUR.2017.33zbMath1442.68102OpenAlexW2963712282MaRDI QIDQ5111647
Benedikt Bollig, Arnaud Sangnier, Karin Quaas
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7799/
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On parametric timed automata and one-counter machines
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Model checking memoryful linear-time logics over one-counter automata
- Hierarchies of complete problems
- Deterministic one-counter automata
- Simulation Problems Over One-Counter Nets
- Branching-Time Model Checking of One-Counter Processes and Timed Automata
- Branching-Time Model Checking of Parametric One-Counter Automata
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Reachability in Succinct and Parametric One-Counter Automata
- Path Checking for MTL and TPTL over Data Words
- On Expressiveness and Complexity in Real-Time Model Checking
- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
- Model Checking Succinct and Parametric One-Counter Automata
- The Effects of Bounding Syntactic Resources on Presburger LTL
- Two-Way Tree Automata Solving Pushdown Games
- Parametric real-time reasoning
- Reachability in Two-Clock Timed Automata Is PSPACE-Complete
- Distributed Timed Automata with Independently Evolving Clocks
- Alternation Elimination by Complementation (Extended Abstract)
- Term Rewriting and Applications
- Foundations of Software Science and Computation Structures
