2000 character limit reached
Higher-Dimensional Timed Automata (1802.07038v1)
Published 20 Feb 2018 in cs.LO and cs.SY
Abstract: 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.