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 条

[21] Decidability Problems in Petri Nets with Names and Replication
Rosa-Velardo, Fernando
de Frutos-Escrig, David
FUNDAMENTA INFORMATICAE, 2010, 105 (03) : 291 - 317
[22] Decidability and complexity of Petri nets with unordered data
Rosa-Velardo, Fernando
de Frutos-Escrig, David
THEORETICAL COMPUTER SCIENCE, 2011, 412 (34) : 4439 - 4451
[23] Decidability problems of a basic class of object nets
Dietze, Roxana
Kudlek, Manfred
Kummer, Olaf
FUNDAMENTA INFORMATICAE, 2007, 79 (3-4) : 295 - 302
[24] Decidability of some classes of modal logic
Norgela S.
Lithuanian Mathematical Journal, 2002, 42 (2) : 174 - 181
[25] A partial order semantics for FIFO-nets
Bernardeschi, C
De Francesco, N
Vaglini, G
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1998, E81D (08) : 773 - 782
[26] CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES
Recalde, Laura
Haddad, Serge
Silva, Manuel
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (02) : 235 - 256
[27] Decidability of the AE-theory of the lattice of classes
Lawton, Linda
ARCHIVE FOR MATHEMATICAL LOGIC, 2018, 57 (3-4) : 429 - 451
[28] Continuous Petri nets: Expressive power and decidability issues
Recalde, Laura
Haddad, Serge
Silva, Manuel
AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2007, 4762 : 362 - +
[29] MODELING OF TIME AND PRIORITY NOTIONS WITH THE HELP OF FIFO NETS
MEMMI, G
REVUE TECHNIQUE THOMSON-CSF, 1983, 15 (02): : 389 - 414
[30] SOME CONSEQUENCES OF THE DECIDABILITY OF THE REACHABILITY PROBLEM FOR PETRI NETS
LAMBERT, JL
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 340 : 266 - 282

← 1 2 3 4 5 →