DocumentCode :
1519768
Title :
Synthesising certificates in networks of timed automata
Author :
Finkbeiner, B. ; Peter, H.-J. ; Schewe, Sven
Author_Institution :
Fachrichtung Inf., Univ. des Saarlandes, Saarbrücken, Germany
Volume :
4
Issue :
3
fYear :
2010
fDate :
6/1/2010 12:00:00 AM
Firstpage :
222
Lastpage :
235
Abstract :
The authors present an automatic method for the synthesis of certificates for components in embedded real-time systems. A certificate is a small homomorphic abstraction that can transparently replace the component during model checking: if the verification with the certificate succeeds, then the component is guaranteed to be correct; if the verification with the certificate fails, then the component itself must be erroneous. The authors give a direct construction, based on a forward and backward reachability analysis of the timed system, and an iterative refinement process, which produces a series of successively smaller certificates. In their experiments, model checking the certificate is several orders of magnitude faster than model checking the original system.
Keywords :
automata theory; embedded systems; formal verification; iterative methods; reachability analysis; backward reachability analysis; certificate synthesis; embedded real-time systems; forward reachability analysis; homomorphic abstraction; iterative refinement process; model checking; timed automata;
fLanguage :
English
Journal_Title :
Software, IET
Publisher :
iet
ISSN :
1751-8806
Type :
jour
DOI :
10.1049/iet-sen.2009.0047
Filename :
5487642
Link To Document :
بازگشت