+44 (0)1509 263171
Please use this identifier to cite or link to this item:
|Title: ||On the decidability and complexity of problems for restricted hierarchical hybrid systems|
|Authors: ||Bell, Paul C.|
Jackson, Lisa M.
|Keywords: ||Hybrid systems|
Reachability and mortality
Piecewise affine maps
(Hierarchical) piecewise constant derivatives
|Issue Date: ||2016|
|Publisher: ||© Elsevier|
|Citation: ||BELL, P.C., CHEN, S. and JACKSON, L.M., 2016. On the decidability and complexity of problems for restricted hierarchical hybrid systems. Theoretical Computer Science, 652, pp. 47-63.|
|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.|
|Description: ||This paper is closed access until 13th September 2017.|
|Version: ||Accepted for publication|
|Publisher Link: ||http://dx.doi.org/10.1016/j.tcs.2016.09.003|
|Appears in Collections:||Closed Access (Computer Science)|
Files associated with this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.