Eliminating the storage tape in reachability constructions.

DOI10.1016/S0304-3975(02)00545-5zbMath1042.68065OpenAlexW2015155803MaRDI QIDQ1874416

Zhe Dang, Oscar H. Ibarra

Publication date: 25 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00545-5

zbMATH Keywords

Presburger arithmeticReachabilityPushdown timed automatonReversal-bounded counters

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On store languages and applications ⋮ Semilinearity of Families of Languages

Uses Software

• ALGOL 60

Cites Work

• A theory of timed automata
• Analysis of a class of communicating finite state machines
• Verification in loosely synchronous queue-connected discrete timed automata.
• Boundedness, empty channel detection, and synchronization for communicating finite automata
• Verifying programs with unreliable channels
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Bounded Algol-Like Languages
• Reachability analysis of pushdown automata: Application to model-checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Eliminating the storage tape in reachability constructions.