Timed context-free temporal logics

MaRDI QIDQ3384894zbMATH OpenFDO

Authors

Publication date 17 December 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF18.17

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of game theory (91A80)

Recommendations

• Context-free timed formalisms: robust automata and linear temporal logics
• A logical characterization of timed pushdown languages
• Visibly linear temporal logic
• Realizability of real-time logics
• A really temporal logic

Cites work

• A logical characterization for dense-time visibly pushdown automata
• A theory of timed automata
• Dense-timed pushdown automata
• Event-clock automata: a determinizable class of timed automata
• Event-clock nested automata
• Event-Clock Visibly Pushdown Automata
• Foundations of Software Science and Computation Structures
• 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?)
• Hybrid Systems: Computation and Control
• On the decidability and complexity of Metric Temporal Logic over finite words
• Pushdown module checking
• Real-time logics: Complexity and expressiveness
• Recursive timed automata
• The benefits of relaxing punctuality
• Timed context-free temporal logics
• 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

(12)

• Context-free timed formalisms: robust automata and linear temporal logics
• Timed context-free temporal logics
• Timed Temporal Logics for Abstracting Transient States
• scientific article; zbMATH DE number 1502114 (Why is no real title available?)
• scientific article; zbMATH DE number 7020139 (Why is no real title available?)
• scientific article; zbMATH DE number 4119592 (Why is no real title available?)
• Model Theoretic Syntax and Parsing
• A first-order complete temporal logic for structured context-free languages
• Substructure Temporal Logic
• Logic Programming
• Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic
• Model-checking structured context-free languages

This page was built for publication: Timed context-free temporal logics

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