SAFE EXECUTIONS OF RECOGNIZABLE TRACE LANGUAGES BY ASYNCHRONOUS AUTOMATA

被引：0
|
作者：
ZIELONKA, W
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 363卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：278 / 289
页数：12
相关论文
共 50 条
  • [31] Recognizable languages of arrows and cospans
    Bruggink, H. J. Sander
    Koenig, Barbara
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (08) : 1290 - 1332
  • [32] RECOGNIZABLE LANGUAGES IN CONCURRENCY MONOIDS
    DROSTE, M
    THEORETICAL COMPUTER SCIENCE, 1995, 150 (01) : 77 - 109
  • [33] Recognizable languages in divisibility monoids
    Droste, M
    Kuske, D
    FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 246 - 257
  • [34] On recognizable languages of infinite pictures
    Finkel, O
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (06) : 823 - 840
  • [35] On recognizable infinite array languages
    Gnanasekaran, S
    Dare, VR
    COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2004, 3322 : 209 - 218
  • [36] ASYNCHRONOUS AUTOMATA VERSUS ASYNCHRONOUS CELLULAR-AUTOMATA
    PIGHIZZINI, G
    THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 179 - 207
  • [37] Finding Divergent Executions in Asynchronous Programs
    El-Zawawy, Mohamed A.
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT V, 2016, 9790 : 410 - 421
  • [38] A Library to Modularly Control Asynchronous Executions
    Fukuda, Hiroaki
    Leger, Paul
    30TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, VOLS I AND II, 2015, : 1648 - 1650
  • [39] A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages
    Vaandrager, Frits
    Midya, Abhisek
    THEORETICAL ASPECTS OF COMPUTING, ICTAC 2020, 2020, 12545 : 43 - 63
  • [40] FAMILIES RECOGNIZABLE BY FINITE BRANCHING AUTOMATA
    BENDA, V
    BENDOVA, K
    KYBERNETIKA, 1977, 13 (05) : 293 - 319
12345