Synthesising certificates in networks of timed automata

被引:1
|
作者
Finkbeiner, B. [1 ]
Peter, H. -J. [1 ]
Schewe, S. [2 ]
机构
[1] Univ Saarland, Fachrichtung Informat, D-661223 Saarbrucken, Germany
[2] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England
关键词
ASSUMPTIONS;
D O I
10.1049/iet-sen.2009.0047
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 veri. cation with the certificate succeeds, then the component is guaranteed to be correct; if the veri. cation 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.
引用
收藏
页码:222 / 235
页数:14
相关论文
共 50 条
  • [1] Synthesizing Certificates in Networks of Timed Automata
    Finkbeiner, Bernd
    Peter, Hans-Joerg
    Schewe, Sven
    [J]. RTSS: 2008 REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2008, : 183 - +
  • [2] Synthesising Optimal Timing Delays for Timed I/O Automata
    Diciolla, Marco
    Kim, Chang Hwan Peter
    Kwiatkowska, Marta
    Mereacre, Alexandru
    [J]. 2014 INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE (EMSOFT), 2014,
  • [3] Timed unfoldings for networks of timed automata
    Bouyer, Patricia
    Haddad, Serge
    Reynier, Pierre-Alain
    [J]. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2006, 4218 : 292 - 306
  • [4] From Timed Reo Networks to Networks of Timed Automata
    Kokash, Natallia
    Jaghoori, Mohammad Mahdi
    Arbab, Farhad
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2013, 295 : 11 - 29
  • [5] Avoiding Shared Clocks in Networks of Timed Automata Avoiding Shared Clocks in Networks of Timed Automata
    Balaguer, Sandie
    Chatain, Thomas
    [J]. CONCUR 2012 - CONCURRENCY THEORY, 2012, 7454 : 100 - 114
  • [6] Symbolic unfoldings for networks of timed automata
    Cassez, Franck
    Chatain, Thomas
    Jard, Claude
    [J]. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2006, 4218 : 307 - 321
  • [7] Time for Networks: Mutation Testing for Timed Automata Networks
    Cortes, David
    Ortiz, James
    Basile, Davide
    Aranda, Jesus
    Perrouin, Gilles
    Schobbens, Pierre-Yves
    [J]. PROCEEDINGS OF THE 2024 IEEE/ACM 12TH INTERNATIONAL CONFERENCE ON FORMAL METHODS IN SOFTWARE ENGINEERING, FORMALISE 2024, 2024, : 44 - 54
  • [8] Timed Virtual Stationary Automata for mobile networks
    Dolev, Shlomi
    Gilbert, Seth
    Lahiani, Limor
    Lynch, Nancy
    Nolte, Tina
    [J]. PRINCIPLES OF DISTRIBUTED SYSTEMS, 2006, 3974 : 130 - +
  • [9] Formal Validation of Neural Networks as Timed Automata
    De Maria, Elisabetta
    Di Giusto, Cinzia
    Ciatto, Giovanni
    [J]. PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SYSTEMS-BIOLOGY AND BIOINFORMATICS (CSBIO 2017), 2017, : 15 - 22
  • [10] AVOIDING SHARED CLOCKS IN NETWORKS OF TIMED AUTOMATA
    Balaguer, Sandie
    Chatain, Thomas
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (04)