Past pushdown timed automata

DOI10.1007/3-540-36390-4_7MaRDI QIDQ4412570zbMATH OpenFDO

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

Publication date 15 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2494/24940074.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Past pushdown timed automata and safety verification.
• Binary reachability analysis of discrete pushdown timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• On removing the pushdown stack in reachability constructions
• Eliminating the storage tape in reachability constructions.

Cited in

(9)

• Past pushdown timed automata and safety verification.
• Eliminating the storage tape in reachability constructions.
• Binary reachability analysis of discrete pushdown timed automata
• Event-Clock Visibly Pushdown Automata
• Pumping lemmas for timed automata
• On removing the pushdown stack in reachability constructions
• Timed Pushdown Automata Revisited
• Timed pushdown automata and branching vector addition systems
• Timed P Automata

This page was built for publication: Past pushdown timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412570)