Effective definability of the reachability relation in timed automata

DOI10.1016/j.ipl.2019.105871zbMath1478.68126arXiv1903.09773OpenAlexW2981343893WikidataQ127010321 ScholiaQ127010321MaRDI QIDQ2338218

James Worrell, Mahsa Shirmohammadi, Martin Fränzle, Karin Quaas

Publication date: 21 November 2019

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

real-time systemssemilinear setsPresburger arithmeticregion automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30)

Related Items (5)

Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ Timed Basic Parallel Processes ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• A theory of timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Effective definability of the reachability relation in timed automata