Timed Automata Patterns

被引:47
|
作者
Dong, Jin Song [1 ]
Hao, Ping [1 ]
Qin, Shengchao [2 ]
Sun, Jun [1 ]
Yi, Wang [3 ,4 ]
机构
[1] Natl Univ Singapore, Sch Comp, Singapore 117543, Singapore
[2] Univ Durham, Dept Comp Sci, Sci Labs, Durham DH1 3LE, England
[3] N Eastern Univ, Sch Sci & Engn, Shenyang, Peoples R China
[4] Uppsala Univ, Dept Informat Technol, Uppsala 75105, Sweden
关键词
Timed Automata; timed patterns; TCOZ; UPPAAL;
D O I
10.1109/TSE.2008.52
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables. A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design. Specification languages like Timed Communicating Sequential Process (CSP) and Timed Communicating Object-Z (TCOZ) are well suited for presenting compositional models of complex real-time systems. In this work, we define a set of composable Timed Automata patterns based on hierarchical constructs in time-enriched process algebras. The patterns facilitate the hierarchical design of complex systems using Timed Automata. They also allow a systematic translation from Timed CSP/TCOZ models to Timed Automata so that analyzers for Timed Automata can be used to reason about TCOZ models. A prototype has been developed to support system design using Timed Automata patterns or, if given a TCOZ specification, to automate the translation from TCOZ to Timed Automata.
引用
收藏
页码:844 / 859
页数:16
相关论文
共 50 条
  • [31] Dynamical properties of timed automata
    Puri, A
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2000, 10 (1-2): : 87 - 113
  • [32] DETERMINISABILITY OF REGISTER AND TIMED AUTOMATA
    Clemente, Lorenzo
    Lasota, Slawomir
    Piorkowski, Radoslaw
    LOGICAL METHODS IN COMPUTER SCIENCE, 2022, 18 (02) : 1 - 9
  • [33] From Scenarios to Timed Automata
    Saeedloei, Neda
    Kluzniak, Feliks
    FORMAL METHODS: FOUNDATIONS AND APPLICATIONS, SBMF 2017, 2017, 10623 : 33 - 51
  • [34] Dynamical Properties of Timed Automata
    Anuj Puri
    Discrete Event Dynamic Systems, 2000, 10 : 87 - 113
  • [35] A Model Interpreter for Timed Automata
    Iftikhar, M. Usman
    Lundberg, Jonas
    Weyns, Danny
    LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION AND VALIDATION: FOUNDATIONAL TECHNIQUES, PT I, 2016, 9952 : 243 - 258
  • [36] Debugging with Timed Automata Mutations
    Aichernig, Bernhard K.
    Hoermaier, Klaus
    Lorber, Florian
    COMPUTER SAFETY, RELIABILITY, AND SECURITY (SAFECOMP 2014), 2014, 8666 : 49 - 64
  • [37] Making timed automata communicate
    Chen, J
    Lin, HM
    FORMAL METHODS AT THE CROSSROADS: FROM PANACEA TO FOUNDATIONAL SUPPORT, 2003, 2757 : 337 - 351
  • [38] SAMPLED SEMANTICS OF TIMED AUTOMATA
    Abdulla, Parosh Aziz
    Krcal, Pavel
    Yi, Wang
    LOGICAL METHODS IN COMPUTER SCIENCE, 2010, 6 (03)
  • [39] Dynamic Timed Automata for Reconfigurable System Modeling and Verification
    Tigane, Samir
    Guerrouf, Faycal
    Hamani, Nadia
    Kahloul, Laid
    Khalgui, Mohamed
    Ali, Masood Ashraf
    AXIOMS, 2023, 12 (03)
  • [40] VERIFICATION OF A FIELDBUS SCHEDULING PROTOCOL USING TIMED AUTOMATA
    Petalidis, Nicholaos
    COMPUTING AND INFORMATICS, 2009, 28 (05) : 655 - 672