DECIDABILITY OF A TEMPORAL LOGIC PROBLEM FOR PETRI NETS

被引：39

作者：

JANCAR, P

机构：

[1] Mining Institute of the Czechoslovak Academy of Sciences, A. Římana 1768

来源：

THEORETICAL COMPUTER SCIENCE | 1990年 / 74卷 / 01期

关键词：

D O I：

10.1016/0304-3975(90)90006-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The paper solves an open problem from [4] by showing a decision algorithm for a temporal logic language L(Q′, GF). It implies the decidability of the problem of the existence of an infinite weakly fair occurence sequence for a given Petri net; thereby an open problem from [2] is solved. © 1990.

引用

页码：71 / 93

页数：23

共 8 条

[1]

BEST E, 1985, PETRI NETS NEWSLETTE, V20

[2]

Carstensen H., 1987, STACS 87. 4th Annual Symposium on Theoretical Aspects of Computer Science. Proceedings, P396, DOI 10.1007/BFb0039622

[3]

Higman G., 1952, P LOND MATH SOC, V3, P326, DOI 10.1112/plms/s3-2.1.326

[4]

HOWELL RR, 1988, LECT NOTES COMPUT SC, V324, P351, DOI 10.1007/BFb0017158

[5]

JANCAR P, 1987, THESIS CHARLES U PRA

[6]

KOSARAJU SR, 1982, 14TH P ANN S THEOR C, P267

[7]

Lipton R., 1976, 62 YAL U DEP COMP SC

[8] AN ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM [J].

MAYR, EW .

SIAM JOURNAL ON COMPUTING, 1984, 13 (03) :441-460

← 1 →