scientific article; zbMATH DE number 7136659
From MaRDI portal
Publication:4972731
DOI10.23638/LMCS-15(3:33)2019zbMath1442.68101arXiv1609.06124MaRDI QIDQ4972731
Arnaud Sangnier, Benedikt Bollig, Karin Quaas
Publication date: 26 November 2019
Full work available at URL: https://arxiv.org/abs/1609.06124
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
- Shortest Paths in One-Counter Systems
- 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
- Reachability in Succinct and Parametric One-Counter Automata
- Language Emptiness of Continuous-Time Parametric Timed 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
- The Complexity of Flat Freeze LTL
- Parametric real-time reasoning
- Distributed Timed Automata with Independently Evolving Clocks
- Alternation Elimination by Complementation (Extended Abstract)
- Term Rewriting and Applications
- Foundations of Software Science and Computation Structures
