Subclasses of recognizable trace languages

被引：0
|
作者：
Reineke, H
机构：
来源：
APPLICATION AND THEORY OF PETRI NETS 1995 | 1995年 / 935卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Mazurkiewicz's traces combine the concepts bf formal language theory with concurrency. The class of recognizable trace languages can be characterized by means of Zielonka's finite asynchronous automaton which is representable by a labelled safe Petri net. In this paper subclasses of the recognizable trace languages are defined by restricting the structure of the automaton. The subclasses are characterized and relations between them are examined.
引用
收藏
页码：357 / 373
页数：17
相关论文
共 50 条
  • [1] On Subclasses of Recognizable ?? - Partial Array Languages
    Muhiuddin, G.
    Janaki, K.
    Al-Kadi, D.
    Arulprakasam, R.
    Govindan, V.
    JOURNAL OF MATHEMATICS, 2022, 2022
  • [2] RECOGNIZABLE COMPLEX TRACE LANGUAGES
    DIEKERT, V
    GASTIN, P
    PETIT, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 520 : 131 - 140
  • [3] On recognizable stable trace languages
    Husson, JF
    Morin, R
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 2000, 1784 : 177 - 191
  • [4] RATIONAL AND RECOGNIZABLE COMPLEX TRACE LANGUAGES
    DIEKERT, V
    GASTIN, P
    PETIT, A
    INFORMATION AND COMPUTATION, 1995, 116 (01) : 134 - 153
  • [5] EXPLORING INSIDE TILING RECOGNIZABLE PICTURE LANGUAGES TO FIND DETERMINISTIC SUBCLASSES
    Giammarresi, Dora
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (07) : 1519 - 1532
  • [6] RECOGNIZABLE TRACE LANGUAGES, DISTRIBUTED AUTOMATA AND THE DISTRIBUTION PROBLEM
    PETIT, A
    ACTA INFORMATICA, 1993, 30 (01) : 89 - 101
  • [7] SAFE EXECUTIONS OF RECOGNIZABLE TRACE LANGUAGES BY ASYNCHRONOUS AUTOMATA
    ZIELONKA, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 363 : 278 - 289
  • [8] Classifying Recognizable Infinitary Trace Languages Using Word Automata
    Chaturvedi, Namit
    Gelderie, Marcus
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 171 - 182
  • [9] Classifying recognizable infinitary trace languages using word automata
    Chaturvedi, Namit
    Gelderie, Marcus
    INFORMATION AND COMPUTATION, 2017, 256 : 23 - 34
  • [10] On recognizable timed languages
    Maler, O
    Pnueli, A
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2004, 2987 : 348 - 362
12345