Synthesis of distributed algorithms using asynchronous automata

被引：0
|
作者：
Stefanescu, A
Esparza, J
Muscholl, A
机构：
[1] Inst Formale Methoden Informat, D-70569 Stuttgart, Germany
[2] Univ Paris 07, LIAFA, F-75251 Paris 05, France
来源：
CONCUR 2003 - CONCURRENCY THEORY | 2003年 / 2761卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework. Theorems by Zielonka and Morin are then used to develop and implement a synthesis algorithm. Finally, we apply the developed algorithms to the classic problem of mutual exclusion.
引用
收藏
页码：27 / 41
页数：15
相关论文
共 50 条
  • [1] Distributed Asynchronous Automata
    Baudru, Nicolas
    [J]. CONCUR 2009 - CONCURRENCY THEORY, PROCEEDINGS, 2009, 5710 : 115 - 130
  • [2] Distributed time-asynchronous automata
    Dima, Catalin
    Lanotte, Ruggero
    [J]. THEORETICAL ASPECTS OF COMPUTING - ICTAC 2007, PROCEEDINGS, 2007, 4711 : 185 - +
  • [3] Distributed simulation of sets of asynchronous automata
    Kacprzak, M
    [J]. ESM'99 - MODELLING AND SIMULATION: A TOOL FOR THE NEXT MILLENNIUM, VOL 1, 1999, : 215 - 219
  • [4] SYNTHESIS OF ASYNCHRONOUS FINITE AUTOMATA
    YAKUBAYT.EA
    GOBZEMIS, AY
    PETRENKO, AF
    FRITSNOV.GF
    [J]. ENGINEERING CYBERNETICS, 1972, 10 (06): : 1064 - 1071
  • [5] Unfolding synthesis of asynchronous automata
    Baudru, Nicolas
    Morin, Remi
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 46 - 57
  • [6] Compositional synthesis of asynchronous automata
    Baudru, Nicolas
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (29) : 3701 - 3716
  • [7] A DYNAMIC DEBUGGER FOR ASYNCHRONOUS DISTRIBUTED ALGORITHMS
    SOREL, PE
    FERNANDEZ, MG
    GHOSH, S
    [J]. IEEE SOFTWARE, 1994, 11 (01) : 69 - 76
  • [8] Asynchronous cellular automata and asynchronous automata for pomsets
    Kuske, D
    [J]. CONCUR'98: CONCURRENCY THEORY, 1998, 1466 : 517 - 532
  • [9] REALIZATION OF PARALLEL DIGITAL-CONTROL ALGORITHMS BY ASYNCHRONOUS AUTOMATA
    CHEREMISINOVA, LD
    [J]. AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1985, (02): : 65 - 69
  • [10] On the average communication complexity of asynchronous distributed algorithms
    Massachusetts Inst of Technology, Cambridge, United States
    [J]. Journal of the ACM, 1995, 42 (02): : 382 - 400
12345