Author of the publication

Reachability in Dynamical Systems with Rounding.

, , , , , , , , and . FSTTCS, volume 182 of LIPIcs, page 36:1-36:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reachability in Dynamical Systems with Rounding., , , , , , , , and . FSTTCS, volume 182 of LIPIcs, page 36:1-36:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems., , , , , and . MFCS, volume 241 of LIPIcs, page 40:1-40:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Orbit Problem for Parametric Linear Dynamical Systems., , , , , , , , , and . CONCUR, volume 203 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Multiple Reachability in Linear Dynamical Systems., , , and . CoRR, (2024)Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications., , , , , , , , and . CONCUR, volume 243 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Linear dynamical systems with continuous weight functions., , , , and . HSCC, page 22:1-22:11. ACM, (2024)On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates., , , , , and . LICS, page 11:1-11:14. ACM, (2024)The Monadic Theory of Toric Words., , , , and . CoRR, (2023)What's Decidable About Discrete Linear Dynamical Systems?, , , and . Principles of Systems Design, volume 13660 of Lecture Notes in Computer Science, page 21-38. Springer, (2022)The Pseudo-Skolem Problem is Decidable., , , , , , and . MFCS, volume 202 of LIPIcs, page 34:1-34:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)