Conference
Formal Verification of the Implementability of Timing Requirements
Abstract
There has been relatively little work on the implementability of timing requirements. We have previously provided definitions of fundamental timing operators that explicitly considered tolerances on property durations and intersample jitter. In this work we identify three environmental assumptions and compare the implementability of a Held_For operator in each of them, formalizing this analysis in PVS. We show how to design a software component …
Authors
Hu X; Lawford M; Wassyng A
Series
Lecture Notes in Computer Science
Volume
5596
Pagination
pp. 119-134
Publisher
Springer Nature
Publication Date
2009
DOI
10.1007/978-3-642-03240-0_12
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743