Dynamic data structures for timed automata acceptance
From MaRDI portal
Publication:2093569
Recommendations
Cites work
- A brief account of runtime verification
- A theory of timed automata
- Automata theory on sliding windows
- Dynamic parameterized problems and algorithms
- Fault diagnosis for timed automata
- Higher lower bounds from the 3SUM conjecture
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- scientific article; zbMATH DE number 3428547 (Why is no real title available?)
- Maintaining Stream Statistics over Sliding Windows
- On a class of \(O(n^ 2)\) problems in computational geometry
- On a class of O(n^2) problems in computational geometry
- Querying regular languages over sliding windows
- Recognizing well-parenthesized expressions in the streaming model
- Streaming algorithms for language recognition problems
- Threesomes, degenerates, and love triangles
- Timed automata and additive clock constraints
- Timed Pushdown Automata Revisited
- Towards polynomial lower bounds for dynamic problems
Cited in
(3)
This page was built for publication: Dynamic data structures for timed automata acceptance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093569)