Higher-Dimensional Timed Automata
Logic in Computer Science
2018-02-21 v1 Systems and Control
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.
Keywords
Cite
@article{arxiv.1802.07038,
title = {Higher-Dimensional Timed Automata},
author = {Uli Fahrenberg},
journal= {arXiv preprint arXiv:1802.07038},
year = {2018}
}