Past pushdown timed automata and safety verification.

DOI10.1016/j.tcs.2003.10.004zbMath1069.68065OpenAlexW2117431842MaRDI QIDQ1426159

Richard A. Kemmerer, Tevfik Bultan, Oscar H. Ibarra, Zhe Dang

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.004

zbMATH Keywords

Presburger arithmeticTemporal logicTimed automataAutomated verificationPast formulas

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Timed recursive state machines: expressiveness and complexity ⋮ A survey of timed automata for the development of real-time systems

Uses Software

• ASTRAL

Cites Work

• A theory of timed automata
• Counter machines and verification problems.
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• A really temporal logic
• Reachability analysis of pushdown automata: Application to model-checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item