@inproceedings{https___doi.org_10.4230_lipics.csl.2025.18,
    doi = {10.4230/lipics.csl.2025.18},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.18},
    author = {Scoones, Andrew and Shirmohammadi, Mahsa and Worrell, James},
    keywords = {Bilinear constraints, Existential theory of real closed fields, Diophantine approximation, Pareto curve, Theory of computation → Logic and verification, Theory of computation → Quantitative automata, Theory of computation → Timed and hybrid models, Theory of computation → Verification by model checking},
    language = {en},
    title = {Reachability for Multi-Priced Timed Automata with Positive and Negative Rates},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2025},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-2-13 7:18:42 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.csl.2025.18, doi = {10.4230/lipics.csl.2025.18}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.18}, author = {Scoones, Andrew and Shirmohammadi, Mahsa and Worrell, James}, keywords = {Bilinear constraints, Existential theory of real closed fields, Diophantine approximation, Pareto curve, Theory of computation → Logic and verification, Theory of computation → Quantitative automata, Theory of computation → Timed and hybrid models, Theory of computation → Verification by model checking}, language = {en}, title = {Reachability for Multi-Priced Timed Automata with Positive and Negative Rates}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2025}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-2-13 7:18:42 +0100} }