Higher-Dimensional Timed Automata [article]

Uli Fahrenberg
2018 arXiv   pre-print
We introduce a new formalism of higher-dimensional timed automata, based on van Glabbeek's higher-dimensional automata and Alur's timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based algorithms. We also show how to use tensor products to combat state-space explosion and how to extend the setting to higher-dimensional hybrid automata.
arXiv:1802.07038v1 fatcat:kav2n3442negjgigq5avg5xmv4