On the Semantics of Petri Nets: Processes, Unfoldings and Infinite Computations

被引：0
|
作者：
Sassone, V.
机构：
来源：
Bulletin of the European Association for Theoretical Computer Science | 1994年 / 53期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] ITL semantics of composite Petri nets
    Duan, Zhenhua
    Klaudel, Hanna
    Koutny, Maciej
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2013, 82 (02): : 95 - 110
  • [42] Enforcing Periodic Transition Deadlines in Time Petri Nets With Net Unfoldings
    Wang, Haisheng
    Grigore, Liviu
    Buy, Ugo
    Lehene, Mihai
    Darabi, Houshang
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2011, 41 (03): : 522 - 539
  • [43] INFINITE BEHAVIOR AND FAIRNESS IN PETRI NETS
    CARSTENSEN, H
    VALK, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 188 : 83 - 100
  • [44] Homothecy, bifurcations, continuity and monotonicity in timed continuous Petri nets under infinite server semantics
    Navarro-Gutierrez, Manuel
    Ramirez-Trevino, Antonio
    Silva, Manuel
    NONLINEAR ANALYSIS-HYBRID SYSTEMS, 2017, 26 : 48 - 67
  • [45] INFINITE BEHAVIOR OF DETERMINISTIC PETRI NETS
    CARSTENSEN, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 210 - 219
  • [46] Acyclic and Cyclic Reversing Computations in Petri Nets
    Barylska, Kamila
    Gogolinska, Anna
    FUNDAMENTA INFORMATICAE, 2021, 184 (04) : 273 - 296
  • [47] Complete finite prefixes of symbolic unfoldings of safe time Petri nets
    Chatain, Thomas
    Jard, Claude
    PETRI NETS AND OTHER MODELS OF CONCURRENCY - ICATPN 2006, 2006, 4024 : 125 - 145
  • [48] How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
    Pinna, G. Michele
    APPLICATIONS AND THEORY OF PETRI NETS, 2011, 6709 : 109 - 128
  • [49] Infinite process semantics of inhibitor nets
    Kleijn, H. C. M.
    Koutny, M.
    PETRI NETS AND OTHER MODELS OF CONCURRENCY - ICATPN 2006, 2006, 4024 : 282 - 301
  • [50] Comparative trace semantics of time Petri nets
    Bushin, D. I.
    Virbitskaite, I. B.
    PROGRAMMING AND COMPUTER SOFTWARE, 2015, 41 (03) : 131 - 139
12345