A SURVEY ON THE DECIDABILITY QUESTIONS FOR CLASSES OF FIFO NETS

被引：0

作者：

FINKEL, A

ROSIER, L

机构：

[1] UNIV MONTREAL, MONTREAL H3C 3J7, QUEBEC, CANADA

[2] CTR RECH INFORMAT MONTREAL, MONTREAL H3G 1N2, QUEBEC, CANADA

[3] UNIV TEXAS, DEPT COMP SCI, AUSTIN, TX 78712 USA

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 340卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：106 / 132

页数：27

共 50 条

[41] Decidability of classes of algebraic systems in polynomial time
Anokhin, MI
SBORNIK MATHEMATICS, 2002, 193 (1-2) : 157 - 186
[42] COMPLEXITY AND DECIDABILITY FOR RESTRICTED CLASSES OF PICTURE LANGUAGES
KIM, CW
THEORETICAL COMPUTER SCIENCE, 1990, 73 (03) : 295 - 311
[43] A note on decidability questions on presentations of word semigroups
Choffrut, C
Harju, T
Karhumaki, J
THEORETICAL COMPUTER SCIENCE, 1997, 183 (01) : 83 - 92
[44] Inverse monoids: Decidability and complexity of algebraic questions
Lohrey, Markus
Ondrusch, Nicole
INFORMATION AND COMPUTATION, 2007, 205 (08) : 1212 - 1234
[45] Note on decidability questions on presentations of word semigroups
Choffrut, C.
Harju, T.
Karhumaki, J.
1997, Elsevier Sci B.V., Amsterdam, Netherlands (183)
[46] Decidability Questions for Insertion Systems and Related Models
Malcher, Andreas
FUNDAMENTA INFORMATICAE, 2021, 180 (1-2) : 53 - 76
[47] THE RESIDUE OF VECTOR SETS WITH APPLICATIONS TO DECIDABILITY PROBLEMS IN PETRI NETS
VALK, R
JANTZEN, M
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 188 : 234 - 258
[48] FAIR SERIALIZABILITY OF ITERATED TRANSACTIONS USING FIFO-NETS
FLE, MP
ROUCAIROL, G
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 188 : 154 - 168
[49] Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
Lasota, Slawomir
APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2016, 2016, 9698 : 20 - 36
[50] Decidability boundaries for some classes of nilpotent and solvable groups
Vazhenin Yu.M.
Popov V.Yu.
Algebra and Logic, 2000, 39 (2) : 73 - 77

← 1 2 3 4 5 →