Implementation relations and testing for cyclic systems with refusals and discrete time
- Submitting institution
-
The University of Bradford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 55
- Type
- D - Journal article
- DOI
-
10.1016/j.jss.2020.110738
- Title of journal
- Journal of Systems and Software
- Article number
- 110738
- First page
- 110738
- Volume
- 170
- Issue
- -
- ISSN
- 0164-1212
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2020
- URL
-
https://www.sciencedirect.com/science/article/abs/pii/S0164121220301679?via%3Dihub
- 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 research, extending the work presented at SEFM 2019, is one the main theoretical results obtained in the EPSRC project RoboTest (2018-2023). Although timed extensions of ioco were previously employed in testing, these were not suitable for cyclic systems. The paper defines a novel mathematical framework and test generation algorithms, with significant impact in automating test generation for cyclic systems with discrete time and refusals. The framework is essential to support the main objective of RoboTest, automatic test generation for robotic systems, designed using the RoboChart notation https://www.cs.york.ac.uk/robostar/notations/ and integration in RoboTool (developed in the EPSRC related project RoboCalc).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
