AN ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM

被引：268

作者：

MAYR, EW

机构：

[1] Stanford Univ, Dep of Computer, Science, Stanford, CA, USA, Stanford Univ, Dep of Computer Science, Stanford, CA, USA

来源：

关键词：

D O I：

10.1137/0213029

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：441 / 460

页数：20

共 37 条

[1]

Araki T., 1977, Theoretical Computer Science, V4, P99, DOI 10.1016/0304-3975(77)90059-7

[2]

Baker H., 1973, RABINS PROOF UNDECID

[3]

BERTHELOT G, 1976, MATH F COMPUTER SCI, P202

[4]

COMMONER F, 1972, DEADLOCKS PETRI NETS

[5] PETRI NETS AND SZILARD LANGUAGES [J].

CRESPIREGHIZZI, S ;

MANDRIOLI, D .

INFORMATION AND CONTROL, 1977, 33 (02) :177-192

[6] PROVING TERMINATION WITH MULTI-SET ORDERINGS [J].

DERSHOWITZ, N ;

MANNA, Z .

Dickson, LE .

[8] SEMIGROUPS PRESBURGER FORMULAS AND LANGUAGES [J].

GINSBURG, S ;

SPANIER, EH .

[9] THE DECIDABILITY OF PERSISTENCE FOR VECTOR ADDITION SYSTEMS [J].

GRABOWSKI, J .

[10]

Greibach S. A., 1978, Theoretical Computer Science, V7, P311, DOI 10.1016/0304-3975(78)90020-8