Publication details

<< back
 

Timed Automata Approach to Verification of Systems with Degradation

Basic information
Original title:Timed Automata Approach to Verification of Systems with Degradation
Authors:Jiří Barnat, Ivana Černá, Jana Tůmová
Further information
Citation:BARNAT, Jiří, Ivana ČERNÁ and Jana TŮMOVÁ. Timed Automata Approach to Verification of Systems with Degradation (Timed Automata Approach to Verification of Systems with Degradation). In MEMICS 2011. LNCS 7119. Heidelberg: Springer, 2012. p. 84 - 93, 10 pp. ISBN 978-3-642-25928-9. doi:10.1007/978-3-642-25929-6_8.Export BibTeX
@inproceedings{958862,
author = {Barnat, Jiří and Černá, Ivana and Tůmová, Jana},
address = {Heidelberg},
booktitle = {MEMICS 2011},
doi = {http://dx.doi.org/10.1007/978-3-642-25929-6_8},
edition = {LNCS 7119},
keywords = {model checking; linear temporal properties with degradation},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Heidelberg},
isbn = {978-3-642-25928-9},
pages = {84 - 93},
publisher = {Springer},
title = {Timed Automata Approach to Verification of Systems with Degradation},
year = {2012}
}
Original language:English
Field:Informatics
Type:Article in Proceedings
Keywords:model checking; linear temporal properties with degradation

We focus on systems that naturally incorporate a degrad- ing quality, such as electronic devices with degrading electric charge or broadcasting networks with decreasing power or quality of a transmitted signal. For such systems, we introduce an extension of linear temporal logic with quantitative constraints (Linear Temporal Logic with Degra- dation Constraints) that provides a user-friendly for- malism for specifying properties involving quantitative requirements on the level of degradation. The syntax of DLTL resembles syntax of Metric Interval Temporal Logic (MITL) designed for reasoning about timed systems. Thus, we investigate their relation and a possibility of translating DLTL verication problem for systems with degradation into previously solved MITL verication problem for timed automata. We show, that through the mentioned translation, the DLTL model checking problem can be solved with limited, yet arbitrary, precision.

Related projects:

 
 
top