scientific article; zbMATH DE number 7376045

DOI10.4230/LIPIcs.ICALP.2018.118zbMath1499.68169arXiv1804.10772MaRDI QIDQ5002803

Lorenzo Clemente, Sławomir Lasota

Publication date: 28 July 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

timed automatalinear arithmeticreachability relationtimed pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) First-order arithmetic and fragments (03F30) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (3)

Reachability relations of timed pushdown automata ⋮ Timed Basic Parallel Processes ⋮ Effective definability of the reachability relation in timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Real addition and the polynomial hierarchy
• The complexity of linear problems in fields
• A theory of timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• A survey of homogeneous structures
• Dense-Timed Pushdown Automata
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Timed Pushdown Automata Revisited
• Recursive Timed Automata
• Automated Deduction – CADE-20
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: