Context-free timed formalisms: robust automata and linear temporal logics
From MaRDI portal
Publication:2113377
DOI10.1016/j.ic.2020.104673OpenAlexW3110692397MaRDI QIDQ2113377
Laura Bozzelli, Adriano Peron, Aniello Murano
Publication date: 14 March 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2020.104673
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Timed recursive state machines: expressiveness and complexity
- Ordered multi-stack visibly pushdown automata
- Real-time logics: Complexity and expressiveness
- Pushdown module checking
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- Event-clock nested automata
- A Logical Characterization for Dense-Time Visibly Pushdown Automata
- Interrupt Timed Automata with Auxiliary Clocks and Parameters*
- Dense-Timed Pushdown Automata
- Language Emptiness of Continuous-Time Parametric Timed Automata
- Adding nesting structure to words
- Visibly pushdown languages
- Event-Clock Visibly Pushdown Automata
- The benefits of relaxing punctuality
- On the Expressiveness of Parametric Timed Automata
- Timed Pushdown Automata Revisited
- Recursive Timed Automata
- Tools and Algorithms for the Construction and Analysis of Systems
- On the decidability and complexity of Metric Temporal Logic over finite words
- 2-Visibly Pushdown Automata
- Hybrid Systems: Computation and Control
- Foundations of Software Science and Computation Structures
- Reachability analysis of pushdown automata: Application to model-checking
This page was built for publication: Context-free timed formalisms: robust automata and linear temporal logics
