Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete

DOI10.1007/S00224-023-10121-3MaRDI QIDQ6614617

Mathieu Hilaire, Stefan Göller

Publication date: 7 October 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

computational complexityreachabilityparametric timed automata\textsf{EXPSPACE}-complete

Mathematics Subject Classification ID

Could not fetch data.

This page was built for publication: Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614617)