A high level language for structural relations in well-formed nets

被引:0
|
作者
Capra, L [1 ]
De Pierro, M
Franceschinis, G
机构
[1] Univ Milan, Dip Informat & Comunicaz, Milan, Italy
[2] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy
[3] Univ Piemonte Orientale, Dipartimento Informat, Alessandria, Italy
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Well-formed Nets (WN) structural analysis techniques allow to study interesting system properties without requiring the state space generation. In order to avoid the net unfolding, which would reduce significantly the effectiveness of the analysis, a symbolic calculus allowing to directly work on the WN colour structure is needed. The algorithms for high level Petri nets structural analysis most often require a common subset of operators on symbols annotating the net elements, in particular the arc functions. These operators are the function difference, the function transpose and the function composition. This paper focuses on the first two, it introduces a language to denote structural relations in WN and proves that it is actually closed under the difference and transpose.
引用
收藏
页码:168 / 187
页数:20
相关论文
共 50 条
  • [21] Ill-Formed to Well-Formed Question Generator
    Divate, Manisha Satish
    Salgaonkar, Ambuja
    2016 INTERNATIONAL CONFERENCE ON RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (ICRAIE), 2016,
  • [22] Quantitative Assessment of a Peer-to-peer Cooperative Infrastructure Using Stochastic Well-Formed Nets
    Bellettini, Carlo
    Capra, Lorenzo
    Monga, Mattia
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 128 (04) : 59 - 77
  • [23] A RESOLUTION RULE FOR WELL-FORMED FORMULAS
    BHATTA, KSHSR
    KARNICK, H
    THEORETICAL COMPUTER SCIENCE, 1991, 81 (02) : 223 - 235
  • [24] A RESOLUTION RULE FOR WELL-FORMED FORMULAS
    BHATTA, KSHSR
    KARNICK, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 338 : 400 - 418
  • [25] Enforcing well-formed and partially-formed transactions for Unix
    Povey, D
    USENIX ASSOCIATION PROCEEDINGS OF THE EIGHTH USENIX SECURITY SYMPOSIUM (SECURITY '99), 1999, : 47 - 62
  • [26] Performance and dependability analysis of fault-tolerant memory mechanisms using Stochastic Well-Formed Nets
    Ballarini, P
    Capra, L
    Franceschinis, G
    COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS, 2004, 3280 : 553 - 563
  • [27] Call Admission Control Performance Analysis in Mobile Networks Using Stochastic Well-Formed Petri Nets
    Mokdad, Lynda
    Sene, Mbaye
    Boukerche, Azzedine
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (08) : 1332 - 1341
  • [28] Transforming spontaneous telegraphic language to well-formed Greek sentences for Alternative and Augmentative Communication
    Karberis, G
    Kouroupetroglou, G
    METHODS AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2002, 2308 : 155 - 166
  • [29] The nature of the sign as a WFF -: A well-formed formula
    Taborsky, Edwina
    COMPUTING ANTICIPATORY SYSTEMS, 2006, 839 : 303 - 313
  • [30] An empirical study of rules for well-formed identifiers
    Lawrie, Dawn
    Feild, Henry
    Binkley, David
    JOURNAL OF SOFTWARE MAINTENANCE AND EVOLUTION-RESEARCH AND PRACTICE, 2007, 19 (04): : 205 - 229