scientific article; zbMATH DE number 2080995

zbMATH Open1077.68668MaRDI QIDQ4474093FDOQ4474093

Authors: Oscar H. Ibarra, Zhe Dang 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230244.htm

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

Recommendations

• Eliminating the storage tape in reachability constructions.
• scientific article; zbMATH DE number 1670769
• scientific article; zbMATH DE number 1949647
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Past pushdown timed automata and safety verification.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (9)

• On elimination of state constraints in the construction of reachable sets
• Eliminating the storage tape in reachability constructions.
• Title not available (Why is that?)
• Verification in loosely synchronous queue-connected discrete timed automata.
• Verification of qualitative \(\mathbb Z\) constraints
• Past pushdown timed automata and safety verification.
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Taming strategy logic: non-recurrent fragments
• Title not available (Why is that?)

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 Q4474093)