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

DOI10.1016/J.IC.2020.104673OpenAlexW3110692397MaRDI QIDQ2113377FDOQ2113377

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

zbMATH Keywords

model checkingmetric temporal logictimed automatatemporal logic

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• Timed recursive state machines: expressiveness and complexity
• Dense-Timed Pushdown Automata
• Visibly pushdown languages
• The benefits of relaxing punctuality
• On the Expressiveness of Parametric Timed Automata
• Timed Pushdown Automata Revisited
• Recursive Timed Automata
• Title not available (Why is that?)
• Real-time logics: Complexity and expressiveness
• Adding nesting structure to words
• Foundations of Software Science and Computation Structures
• Title not available (Why is that?)
• On the decidability and complexity of Metric Temporal Logic over finite words
• Ordered multi-stack visibly pushdown automata
• Title not available (Why is that?)
• 2-Visibly Pushdown Automata
• Reachability analysis of pushdown automata: Application to model-checking
• Pushdown module checking
• Tools and Algorithms for the Construction and Analysis of Systems
• Event-clock automata: a determinizable class of timed automata
• Event-Clock Visibly Pushdown Automata
• Hybrid Systems: Computation and Control
• Title not available (Why is that?)
• Title not available (Why is that?)
• Language Emptiness of Continuous-Time Parametric Timed Automata
• Event-clock nested automata
• Interrupt Timed Automata with Auxiliary Clocks and Parameters*
• A Logical Characterization for Dense-Time Visibly Pushdown Automata
• Title not available (Why is that?)

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)