Generalizing the discrete timed automaton

DOI10.1007/3-540-44674-5_13MaRDI QIDQ4540965zbMATH OpenFDO

Authors Oscar H. Ibarra, Jianwen Su

Publication date 28 July 2002

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/2088/20880157

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Augmenting the discrete timed automaton with other data structures.
• Generalized discrete timed automata: Decidable approximations for safety verification.
• SAT-based reachability checking for timed automata with discrete data
• Verification for Timed Automata extended with Unbounded Discrete Data Structures
• Verification for timed automata extended with unbounded discrete data structures

Cited in

(11)

• Verification in loosely synchronous queue-connected discrete timed automata.
• Generalized discrete timed automata: Decidable approximations for safety verification.
• Adding dense-timed stack to integer reset timed automata
• Augmenting the discrete timed automaton with other data structures.
• Eliminating the storage tape in reachability constructions.
• Configurable verification of timed automata with discrete variables
• Verification for timed automata extended with unbounded discrete data structures
• scientific article; zbMATH DE number 1798172 (Why is no real title available?)
• SAT-based reachability checking for timed automata with discrete data
• Developments in Language Theory
• scientific article; zbMATH DE number 5499354 (Why is no real title available?)

This page was built for publication: Generalizing the discrete timed automaton

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