On the determinization of event-clock input-driven pushdown automata

DOI10.1007/978-3-031-09574-0_16OpenAlexW3133677360MaRDI QIDQ2097230

Mizuhito Ogawa, Alexander Okhotin

Publication date: 11 November 2022

Full work available at URL: https://arxiv.org/abs/2103.04079

zbMATH Keywords

state complexitydeterminizationtimed systemsinput-driven pushdown automatavisibly pushdown automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• On regions and zones for event-clock automata
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Event-clock nested automata
• Input-driven pushdown automata on well-nested infinite strings
• A Logical Characterization for Dense-Time Visibly Pushdown Automata
• Input-Driven Pushdown Automata with Limited Nondeterminism
• Dense-Timed Pushdown Automata
• Descriptional Complexity of Input-Driven Pushdown Automata
• Adding nesting structure to words
• Visibly pushdown languages
• Event-Clock Visibly Pushdown Automata
• Timed Pushdown Automata Revisited
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Formal Methods for the Design of Real-Time Systems

This page was built for publication: On the determinization of event-clock input-driven pushdown automata