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 条
  • [41] Flexible query techniques for well-formed XML documents
    Damiani, Ernesto
    Tanca, Letizia
    International Conference on Knowledge-Based Intelligent Electronic Systems, Proceedings, KES, 2000, 2 : 708 - 711
  • [42] Merging topics in well-formed XML topic maps
    Widhalm, R
    Mueck, TA
    SEMANTIC WEB - ISWC 2003, 2003, 2870 : 64 - 79
  • [43] Research on well-formed business process modelling mechanism
    Yi, X. (xieyi@mail.zjgsu.edu.cn), 1600, Transport and Telecommunication Institute, Lomonosova street 1, Riga, LV-1019, Latvia (18):
  • [44] Verification of well-formed communicating recursive state machines
    Bozzelli, L
    La Torre, S
    Peron, A
    VERIFICATION, MODEL CHECKING , AND ABSTRACT INTERPRETATION, PROCEEDINGS, 2006, 3855 : 412 - 426
  • [45] Educating Social Workers to Establish Well-Formed Goals
    Van Voorhis, Rebecca
    Bennett, Robert
    Chang, Valerie
    JOURNAL OF TEACHING IN SOCIAL WORK, 2006, 26 (1-2) : 147 - 161
  • [46] Verification of well-formed communicating recursive state machines
    Bozzelli, Laura
    La Torre, Salvatore
    Peron, Adriano
    THEORETICAL COMPUTER SCIENCE, 2008, 403 (2-3) : 382 - 405
  • [47] Well-formed decompositions of generalized additive independence models
    Michel Grabisch
    Christophe Labreuche
    Mustapha Ridaoui
    Annals of Operations Research, 2022, 312 : 827 - 852
  • [48] Well-formed semantic model for co-learning
    Alomari, Jehad
    Hussain, Mohammed
    Turki, Skander
    Masud, Mehedi
    COMPUTERS IN HUMAN BEHAVIOR, 2015, 51 : 821 - 828
  • [49] Grammatical illusions - well-formed local - global deviant
    Haider, Hubert
    ZEITSCHRIFT FUR SPRACHWISSENSCHAFT, 2011, 30 (02): : 223 - 257
  • [50] A NOTE ON GENERATING WELL-FORMED PARENTHESIS STRINGS LEXICOGRAPHICALLY
    ER, MC
    COMPUTER JOURNAL, 1983, 26 (03): : 205 - 207