REDUCTION AND SYNTHESIS OF LIVE AND BOUNDED FREE-CHOICE PETRI NETS

被引：22
作者：
ESPARZA, J
机构：
[1] Institut für Informatik, Universität Hildesheim, Hildesheim, D-31141
来源：
INFORMATION AND COMPUTATION | 1994年 / 114卷 / 01期
关键词：
D O I：
10.1006/inco.1994.1080
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper provides reduction rules that make it possible to reduce all and only live and bounded Free Choice Petri nets to a circuit containing one place and one transition. The reduction algorithm is shown to require polynomial time in the size of the system. The reduction rules can be transformed into synthesis rules, which can be used for the stepwise construction of large systems. (C) 1994 Academic Press, Inc.
引用
收藏
页码：50 / 87
页数：38
相关论文
共 23 条
[1]  
BERTHELOT G, 1987, LECT NOTES COMPUT SC, V254, P359
[2]  
BERTHELOT G, 1986, ADV PETRI NETS 1985, V222, P1
[3]  
BEST E, 1987, LECT NOTES COMPUT SC, V254, P168
[4]  
Best E., 1990, Formal Aspects of Computing, V2, P123, DOI 10.1007/BF01888220
[5]  
COLOM JM, 1991, LECT NOTES COMPUT SC, V483, P113
[6]   A Polynomial Newton Method for Linear Programming [J].
de Ghellinck, Guy ;
Vial, Jean-Philippe .
ALGORITHMICA, 1986, 1 (1-4) :425-453
[7]   REACHABILITY IN CYCLIC EXTENDED FREE-CHOICE SYSTEMS [J].
DESEL, J ;
ESPARZA, J .
THEORETICAL COMPUTER SCIENCE, 1993, 114 (01) :93-118
[8]  
DESEL J, 1990, LECTURE NOTES COMPUT, P168
[9]  
Dopp K., 1983, Elektronische Informationsverarbeitung und Kybernetik (EIK), V19, P107
[10]  
ESPARZA J, 1991, LECT NOTES COMPUT SC, V524, P118
123