scientific article; zbMATH DE number 1773082

zbMATH Open0989.68074MaRDI QIDQ4540965FDOQ4540965

Jianwen Su, Oscar H. Ibarra

Publication date: 28 July 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2088/20880157

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• Eliminating the storage tape in reachability constructions.
• Verification in loosely synchronous queue-connected discrete timed automata.
• Augmenting the discrete timed automaton with other data structures.
• Generalized discrete timed automata: Decidable approximations for safety verification.
• Title not available (Why is that?)
• Adding dense-timed stack to integer reset timed automata
• Title not available (Why is that?)
• Developments in Language Theory

   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 👍 👎

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)