A STRUCTURE TO DECIDE REACHABILITY IN PETRI NETS

被引：77

作者：

LAMBERT, JL

机构：

[1] Université de Paris-Sud, Centre d'Orsay, Laboratoire de recherche en informatique, 91405 Orsay

来源：

THEORETICAL COMPUTER SCIENCE | 1992年 / 99卷 / 01期

关键词：

D O I：

10.1016/0304-3975(92)90173-D

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A new structure to analyse Petri nets and decide reachability is presented. Originated in Mayr's regular constraint graphs with a consistent marking, it is simplified, cleared and made more flexible by the introduction of the new structure of precovering graph. With its help we prove new results for languages generated by a Petri net and initial and final markings constraints.

引用

页码：79 / 104

页数：26

共 15 条

[1] AUTEBERT JM, 1987, LANGAGES ALGEBRIQUES
[2] DERSHOWITZ N, 1979, COMM ACM, V22
[3] Harrison M, 1978, INTRO FORMAL LANGUAG
[4] Hopcroft J., 1979, Theoretical Computer Science, V8, P135, DOI 10.1016/0304-3975(79)90041-0
[5] JANTZEN M, 1979, RAIRO-INF THEOR-TH C, V13, P19
[6] Karp R.M., 1969, J COMPUT SYST SCI, V3, P147, DOI 10.1016/S0022-0000(69)80011-5
[7] KOSARAJU SR, 1982, 14TH P ANN S THEOR C, P267
[8] FINDING A PARTIAL SOLUTION TO A LINEAR-SYSTEM OF EQUATIONS IN POSITIVE INTEGERS
LAMBERT, JL
[J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1988, 15 (03) : 209 - 212
[9] MAYR E, 1981, 13TH P ANN ACM STOC, P238
[10] AN ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM
MAYR, EW
[J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (03) : 441 - 460

← 1 2 →