A perfect class of context-sensitive timed languages
From MaRDI portal
Recommendations
Cites work
- A logical characterization for dense-time visibly pushdown automata
- A perfect model for bounded verification
- A theory of timed automata
- A unifying approach for multistack pushdown automata
- Dense-timed pushdown automata
- Event-clock automata: a determinizable class of timed automata
- Event-Clock Visibly Pushdown Automata
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- Model-checking of ordered multi-pushdown automata
- Reachability problem for weak multi-pushdown automata
- Recursive timed automata
- Scope-bounded pushdown languages
- The language theory of bounded context-switching
- Visibly pushdown languages
Cited in
(8)- Reachability relations of timed pushdown automata
- On timed scope-bounded context-sensitive languages
- A perfect model for bounded verification
- Untimed Language Preservation in Timed Systems
- A Machine-Independent Characterization of Timed Languages
- Revisiting underapproximate reachability for multipushdown systems
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 6605097 (Why is no real title available?)
This page was built for publication: A perfect class of context-sensitive timed languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817374)