Please use this identifier to cite or link to this item:
Title: Slowdown invariance of timed regular expressions
Authors: Bondin, Ingram
Pace, Gordon J.
Colombo, Christian
Keywords: Object-oriented methods (Computer science)
Computer software -- Development
Computer software -- Quality control
Issue Date: 2009
Publisher: University of Malta. Faculty of Information and Communication Technology
Citation: Bondin, I., Pace, G. J., & Colombo, C. (2009). Slowdown invariance of timed regular expressions. 2nd WICT National Workshop in Information and Communication Technology (WICT 2009), Valletta. 1-6.
Abstract: In critical systems, it is frequently essential to know whether the system satisfies a number of real-time constraints, usually specified in a real-time logic such as timed regular expressions. However, after having verified a system correct, changes in its environment may slow it down or speed it up, possibly invalidating the properties. Colombo et al. (1) have presented a theory of slowdown and speedup invariance to determine which specifications are safe with respect to system retiming, and applied the approach to duration calculus. In this paper we build upon their approach, applying it to timed regular expressions. We hence identify a fragment of the logic which is invariant under the speedup or slowdown of a system, enabling more resilient verification of properties written in the logic.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
Slowdown_Invariance_of_Timed_Regular_Expressions.pdf181.76 kBAdobe PDFView/Open

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.