Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Chen, S and Jackson, L (2016) On the decidability and complexity of problems for restricted hierarchical hybrid systems. Theoretical Computer Science, 652. 47 - 63.

[img]
Preview
Text
1-s2.0-S0304397516304674-main.pdf - Published Version

Download (688kB) | Preview

Abstract

We study variants of a recently introduced hybrid system model, called a Hierarchical Piecewise Constant Derivative (HPCD). These variants (loosely called Restricted HPCDs) form a class of natural models with similarities to many other well known hybrid system models in the literature such as Stopwatch Automata, Rectangular Automata and PCDs. We study the complexity of reachability and mortality problems for variants of RHPCDs and show a variety of results, depending upon the allowed powers. These models form a useful tool for the study of the complexity of such problems for hybrid systems, due to their connections with existing models. We show that the reachability problem and the mortality problem are co-NP-hard for bounded 3-dimensional RHPCDs (3-RHPCDs). Reachability is shown to be in PSPACE, even for n-dimensional RHPCDs. We show that for an unbounded 3-RHPCD, the reachability and mortality problems become undecidable. For a nondeterministic variant of 2-RHPCDs, the reachability problem is shown to be PSPACE-complete.

Item Type: Article
Additional Information: The final version of this article and all relevant information related to it, including copyrights, can be found on the publisher website.
Subjects: Q Science > QA Mathematics
T Technology > T Technology (General)
Divisions: Faculty of Natural Sciences > School of Computing and Mathematics
Related URLs:
Depositing User: Symplectic
Date Deposited: 25 Jul 2022 15:09
Last Modified: 25 Jul 2022 15:09
URI: https://eprints.keele.ac.uk/id/eprint/11110

Actions (login required)

View Item View Item