scientific article; zbMATH DE number 1773082

MaRDI QIDQ4540965zbMATH OpenFDO

Authors Oscar H. Ibarra, Jianwen Su

Publication date 28 July 2002

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)

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

This page was built for publication:

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