Context-free timed formalisms: robust automata and linear temporal logics

DOI10.1016/J.IC.2020.104673MaRDI QIDQ2113377zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, Aniello Murano, Adriano Peron

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

zbMATH Keywords

model checkingmetric temporal logictimed automatatemporal logic

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Timed context-free temporal logics
• Event-clock nested automata
• A logical characterization of timed pushdown languages
• Revisiting timed logics with automata modalities
• A theory of timed automata

Cites work

• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 7447746 (Why is no real title available?)
• scientific article; zbMATH DE number 1980931 (Why is no real title available?)
• scientific article; zbMATH DE number 2090843 (Why is no real title available?)
• scientific article; zbMATH DE number 1400049 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• 2-Visibly Pushdown Automata
• A logical characterization for dense-time visibly pushdown automata
• A theory of timed automata
• Adding nesting structure to words
• Dense-timed pushdown automata
• Event-Clock Visibly Pushdown Automata
• Event-clock automata: a determinizable class of timed automata
• Event-clock nested automata
• Foundations of Software Science and Computation Structures
• Hybrid Systems: Computation and Control
• Interrupt timed automata with auxiliary clocks and parameters
• Language emptiness of continuous-time parametric timed automata
• On the decidability and complexity of Metric Temporal Logic over finite words
• On the expressiveness of parametric timed automata
• Ordered multi-stack visibly pushdown automata
• Pushdown module checking
• Reachability analysis of pushdown automata: Application to model-checking
• Real-time logics: Complexity and expressiveness
• Recursive timed automata
• The benefits of relaxing punctuality
• Timed Pushdown Automata Revisited
• Timed recursive state machines: expressiveness and complexity
• Tools and Algorithms for the Construction and Analysis of Systems
• Visibly pushdown languages

Cited in

(1)

• Special issue: Selected papers of the 12th international conference on language and automata theory and applications, LATA 2018

This page was built for publication: Context-free timed formalisms: robust automata and linear temporal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113377)