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 条
12345