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 条
  • [21] A SURVEY OF RECOGNIZABLE LANGUAGES OF INFINITE TRACES
    GASTIN, P
    PETIT, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 609 : 392 - 409
  • [22] On logically defined recognizable tree languages
    Ésik, Z
    Weil, P
    FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2003, 2914 : 195 - 207
  • [23] Local and recognizable hexagonal picture languages
    Dersanambika, KS
    Krithivasan, K
    Martin-Vide, C
    Subramanian, KG
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2005, 19 (07) : 853 - 871
  • [24] On some recognizable picture-languages
    Reinhardt, K
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 760 - 770
  • [25] ZETA-FUNCTIONS OF RECOGNIZABLE LANGUAGES
    BERSTEL, J
    REUTENAUER, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 93 - 104
  • [26] ON THE STRUCTURE OF RECOGNIZABLE LANGUAGES OF DEPENDENCE GRAPHS
    EHRENFEUCHT, A
    HOOGEBOOM, HJ
    ROZENBERG, G
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1993, 27 (01): : 7 - 22
  • [27] Cut sets as recognizable tree languages
    Borchardt, Bjoern
    Maletti, Andreas
    Seselja, Branimir
    Tepavcevic, Andreja
    Vogler, Heiko
    FUZZY SETS AND SYSTEMS, 2006, 157 (11) : 1560 - 1571
  • [28] Local and recognizable iso picture languages
    Kalyani, T
    Dare, VR
    Thomas, DG
    NEURAL INFORMATION PROCESSING, 2004, 3316 : 738 - 743
  • [29] Recognizable picture languages and domino tiling
    Latteux, M
    Simplot, D
    THEORETICAL COMPUTER SCIENCE, 1997, 178 (1-2) : 275 - 283
  • [30] Languages recognizable by quantum finite automata
    Freivalds, R
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 1 - 14
12345