Dynamic data structures for timed automata acceptance

DOI10.1007/S00453-022-01025-8OpenAlexW3217447083WikidataQ114692101 ScholiaQ114692101MaRDI QIDQ2093569FDOQ2093569

Authors: Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis, Cristian Riveros 

Publication date: 27 October 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01025-8

Recommendations

• Dynamic data structures for timed automata acceptance
• A theory of timed automata
• Testing membership for timed automata
• Augmenting the discrete timed automaton with other data structures.
• Determinisability of register and timed automata

zbMATH Keywords

data streamtimed automatadynamic data structure

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• A theory of timed automata
• On a class of \(O(n^ 2)\) problems in computational geometry
• Towards polynomial lower bounds for dynamic problems
• Threesomes, degenerates, and love triangles
• Timed Pushdown Automata Revisited
• A brief account of runtime verification
• Maintaining Stream Statistics over Sliding Windows
• Title not available (Why is that?)
• Title not available (Why is that?)
• Timed automata and additive clock constraints
• Streaming algorithms for language recognition problems
• On a class of \(O(n^2)\) problems in computational geometry
• Fault diagnosis for timed automata
• Higher lower bounds from the 3SUM conjecture
• Automata theory on sliding windows
• Querying regular languages over sliding windows
• Dynamic parameterized problems and algorithms
• Recognizing well-parenthesized expressions in the streaming model

Cited In (2)

• Testing membership for timed automata
• Dynamic data structures for timed automata acceptance

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)