Augmenting the discrete timed automaton with other data structures.

DOI10.1016/S0304-3975(01)00269-9zbMath1061.68094OpenAlexW1973678919MaRDI QIDQ1853524

Oscar H. Ibarra, Jianwen Su

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00269-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Reachability results for timed automata with unbounded data structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Verification in loosely synchronous queue-connected discrete timed automata.
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS

This page was built for publication: Augmenting the discrete timed automaton with other data structures.