Synthesising Optimal Timing Delays for Timed I/O Automata

被引:2
|
作者
Diciolla, Marco [1 ]
Kim, Chang Hwan Peter [1 ]
Kwiatkowska, Marta [1 ]
Mereacre, Alexandru [1 ]
机构
[1] Univ Oxford, Dept Comp Sci, Oxford, England
关键词
Parametric Synthesis; Cardiac Pacemakers; Counting; MODEL-CHECKING;
D O I
10.1145/2656045.2656073
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In many real-time embedded systems, the choice of values for the timing delays can crucially affect the safety or quantitative characteristics of their execution. We propose a parameter synthesis algorithm that finds optimal timing delays guaranteeing that the system satisfies a given quantitative property. As a modelling framework we consider networks of Timed Input/Output Automata (TIOA) with priorities and parametric guards. To express system properties we extend Metric Temporal Logic (MTL) with counting formulas. We implement the algorithm using constraint solving and Monte Carlo sampling, and demonstrate the feasibility of our approach on a simplified model of a pacemaker. We are able to synthesise timing delays that ensure with high probability that energy usage is minimised, while maintaining the basic safety property of the pacemaker.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] Synthesising certificates in networks of timed automata
    Finkbeiner, B.
    Peter, H. -J.
    Schewe, S.
    [J]. IET SOFTWARE, 2010, 4 (03) : 222 - 235
  • [2] Decomposing verification of timed I/O automata
    Kaynar, DK
    Lynch, N
    [J]. FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 84 - 101
  • [3] Specifying urgency in timed I/O automata
    Gebremichael, B
    Vaandrager, F
    [J]. SEFM 2005: THIRD IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS, 2005, : 64 - 73
  • [4] Removing timed delays in stochastic automata
    Dankar, Fida Kamal
    Bocmann, Gregor v.
    [J]. CIC 2006: 15TH INTERNATIONAL CONFERENCE ON COMPUTING, PROCEEDINGS, 2006, : 247 - +
  • [5] Effective conformance testing of timed I/O automata
    Zhao, Dong
    Ye, Kejiang
    [J]. Zhengzhou Daxue Xuebao/Journal of Zhengzhou University, 2002, 34 (04):
  • [6] Keynote Abstract Timed and Probabilistic I/O Automata
    Lynch, Nancy
    [J]. 2013 28TH ANNUAL IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2013, : 12 - 12
  • [7] From I/O automata to timed I/O automata -: A solution to the 'Generalized Railroad Crossing' in Isabelle/HOLCF
    Grobauer, B
    Müller, O
    [J]. THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 1999, 1690 : 273 - 289
  • [8] On discretization of delays in timed automata and digital circuits
    Asarin, E
    Maler, O
    Pnueli, A
    [J]. CONCUR'98: CONCURRENCY THEORY, 1998, 1466 : 470 - 484
  • [9] Optimal paths in weighted timed automata
    Alur, R
    La Torre, S
    Pappas, GJ
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 318 (03) : 297 - 322
  • [10] Trace-based semantics for probabilistic timed I/O automata
    Mitra, Sayan
    Lynch, Nancy
    [J]. HYBRID SYSTEMS: COMPUTATION AND CONTROL, PROCEEDINGS, 2007, 4416 : 718 - +