Timed automata with data structures for distributed systems design and analysis

被引：2
|
作者：
Lanotte, R
Maggiolo-Schettini, A
Troina, A
机构：
来源：
SEFM 2005: THIRD IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS | 2005年
关键词：
D O I：
10.1109/SEFM.2005.49
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the decidability of reachability. As an application, we model and analyze a cryptographic protocol.
引用
收藏
页码：44 / 53
页数：10
相关论文
共 50 条
  • [1] Distributed reachability analysis in timed automata
    Behrmann G.
    [J]. International Journal on Software Tools for Technology Transfer, 2005, 7 (1) : 19 - 30
  • [2] Dynamic data structures for timed automata acceptance
    Grez, Alejandro
    Mazowiecki, Filip
    Pilipczuk, Michal
    Puppis, Gabriele
    Riveros, Cristian
    [J]. Leibniz International Proceedings in Informatics, LIPIcs, 2021, 214
  • [3] Dynamic Data Structures for Timed Automata Acceptance
    Grez, Alejandro
    Mazowiecki, Filip
    Pilipczuk, Michal
    Puppis, Gabriele
    Riveros, Cristian
    [J]. ALGORITHMICA, 2022, 84 (11) : 3223 - 3245
  • [4] Dynamic Data Structures for Timed Automata Acceptance
    Alejandro Grez
    Filip Mazowiecki
    Michał Pilipczuk
    Gabriele Puppis
    Cristian Riveros
    [J]. Algorithmica, 2022, 84 : 3223 - 3245
  • [5] Data-structures for the verification of timed automata
    Asarin, E
    Bozga, M
    Kerbrat, A
    Maler, O
    Pnueli, A
    Rasse, A
    [J]. HYBRID AND REAL-TIME SYSTEMS, 1997, 1201 : 346 - 360
  • [6] Analysis of distributed control systems using timed automata with guards and dioid algebra
    Ait Oumeziane, Fatima
    Ourghanlian, Alain
    Amari, Said
    [J]. 2020 25TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2020, : 1369 - 1372
  • [7] Reachability results for timed automata with unbounded data structures
    Ruggero Lanotte
    Andrea Maggiolo-Schettini
    Angelo Troina
    [J]. Acta Informatica, 2010, 47 : 279 - 311
  • [8] Reachability results for timed automata with unbounded data structures
    Lanotte, Ruggero
    Maggiolo-Schettini, Andrea
    Troina, Angelo
    [J]. ACTA INFORMATICA, 2010, 47 (5-6) : 279 - 311
  • [9] Diagonal constraints in timed automata: Forward analysis of timed systems
    Bouyer, P
    Laroussinie, F
    Reynier, PA
    [J]. FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2005, 3829 : 112 - 126
  • [10] Using timed automata for response time analysis of distributed real-time systems
    Bradley, S
    Henderson, W
    Kendall, D
    [J]. REAL TIME PROGRAMMING 1999 (WRTP'99), 1999, : 209 - 214
12345