Advances in Parametric Real-Time Reasoning

DOI10.1007/978-3-662-44522-8_11zbMath1426.68140OpenAlexW2133856837MaRDI QIDQ2922008

Joël Ouaknine, Daniel Bundala

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Language Emptiness of Continuous-Time Parametric Timed Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parametric updates in parametric timed automata ⋮ Parametric metric interval temporal logic ⋮ On parametric timed automata and one-counter machines ⋮ Unnamed Item ⋮ What’s Decidable About Parametric Timed Automata?

This page was built for publication: Advances in Parametric Real-Time Reasoning