Nested Petri nets: Multi-level and recursive systems

被引：0
作者：
Lomazova, IA [1 ]
机构：
[1] Russian Acad Sci, Ctr Artificial Intelligence, Program Syst Inst, Pereslavl Zalesskii 152140, Russia
来源：
FUNDAMENTA INFORMATICAE | 2001年 / 47卷 / 3-4期
关键词：
hierarchical multi-agent systems; nested Petri nets; well-structured transition systems; decidability;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Nested Petri nets (NP-nets) is a formalism for modeling hierarchical multi-agent systems. Tokens in nested Petri nets are elements represented by nets themselves. The paper continues investigating semantic properties of NP-nets, started in [10], where two-level NP-nets were studied. Here we consider multi-level and recursive NP-nets, for which decidability of termination and some other properties are proved. A comparison of NP-nets with other Petri net models is given.
引用
收藏
页码：283 / 293
页数：11
相关论文
共 18 条
  • [1] BASHKIN VA, 1999, P INT C ICIT 99 PER
  • [2] Cherkasova L, 1981, LECT NOTES COMPUT SC, V118, P242
  • [3] Dufourd C, 1998, LECT NOTES COMPUT SC, V1443, P103, DOI 10.1007/BFb0055044
  • [4] Farwer B., 1999, Fundamenta Informaticae, V37, P225
  • [5] FARWER B, 2000, THESIS LOG VERL
  • [6] Fundamental structures in well-structured infinite transition systems
    Finkel, A
    Schnoebelen, P
    [J]. LATIN '98: THEORETICAL INFORMATICS, 1998, 1380 : 102 - 118
  • [7] REDUCTION AND COVERING OF INFINITE REACHABILITY TREES
    FINKEL, A
    [J]. INFORMATION AND COMPUTATION, 1990, 89 (02) : 144 - 179
  • [8] HADDAD S, 1999, LNCS, V1639, P228
  • [9] Kruskal J.B., 1960, T AM MATH SOC, V95, P210, DOI [DOI 10.2307/1993287, DOI 10.1090/S0002-9947-1960-0111704-1]
  • [10] Lomazova I. A., 2000, Fundamenta Informaticae, V43, P195
12