On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Submitting institution
-
Liverpool John Moores University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1012
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2016.09.003
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 47
- Volume
- 652
- Issue
- -
- ISSN
- 0304-3975
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This multidisciplinary paper combines two conference papers carried out between Computer Science and Aeronautical Engineering. The techniques are being used for verification in a related PhD project at Loughborough University. The main results are theoretical in nature and provide useful context and techniques for the development of efficient algorithms in hybrid systems by exploring the frontiers of decidability of these models.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
