Process of Petri Nets Extension
- 期刊名字:武汉大学学报(英文版)
- 文件大小:287kb
- 论文作者:ZHOU Guofu,HE Yanxiang,DU Zhuo
- 作者单位:School of Computer
- 更新时间:2020-11-10
- 下载次数:次
Vol.11 No.2 2006 351-354WUJNSWuhan University Journal of Natural SciencesArticle ID: 1007-1202(2006)02 -0351-04Process of Petri Nets Extension0 Introduction口ZHOU Guofu, HE Yanxiangt ,DU Zhuominany new computing platforms, such as the local areaSchool of Computer, Wuhan University, Wuhan 430072,M;network, Internet and the virtual network, are beingHubei, Chinacreated and the network computing has been popular. There-fore, the semantics model based on such platforms is differentAbstract: To describe the dynamic semantics for the net-to the traditional model. Compared with the traditional model,work computing, the concept on process is presented based onthe semantic model with variable, resource and relation. Ac-the network computing model has two special features: first-cordingly, the formal definition of process and the mappingly, computing units (to fulfill a task) are allocated on the dis-rules from the specification of Petri nets extension to processtributed and independent nodes and these nodes possessare discussed in detail respetively. Based on the collectivesources respectively. Furthermore, the central control node isconcepts of process, the specification of dynamic semantics al-so is constructed as a net system. Finally, to ilustratenot necessary. Secondly, the interactions among computingprocess intuitively, an example is specified completely.units are a kind of active interaction instead of the passive in-Key words: network computing; computing model;teraction controlled by the central node. Accordingly, a modelprocess; Petri netsCLC number: TP 301.2for network computing is presented in Ref, [1].In Petri nets, process is an observational record of systemrun, and it describes the system behavior completely and accu-rately-2-4l. Therefore, process is an important method to un-cover the dynamic semantics of system. Based on the mappingrules discussed in this paper, we can construct occurrence netwhich is similar to that of Petri nets. Consequently, we cananalyze and verify the dynamic semantics through the theoriesand methods of occurrence net. Based on Ref.[1], in this paper, the definition and the graphic representation of processare presented respectively.1 Petri Nets ExtensionReceived date: 2005-04-20Based on the traditional computing model-5-8], we pres-ndation item: Supported by Technology Innovation Fundation ofent a seman中国煤化工mpuing which is com-Wuhan UniversityBiography: ZHOU Guofu (1970-), male, Post Doctor, research di-posed of var:TYHC NMH G_To describe the modrection: parallel computing, program semantics and Petri nets.el,Petri net 1s exlclluel. 1l1 uills otcu0n,we only summarizeE- mail:gfzhou@ whu. edu. cn .t To whom correspondence should be addressed. E mail:yxhe@ whu.the extension briefly. The more information can be found inedu. cnRefs. [1-3].Wuhan Uniyergi数gnal of Natural Sciences Vol.11 No.2 2006There are two kinds of places : control place and var-iable place. Control place is same as that of PetriM°: S.- > VU{nout); V is a set of typed values andnet9,10]. Variable place is a special extension to Petrinout is NULL;net. The graphic representation of variable place is sameE: T→bool.as that of control place. Token in a variable place is de-noted by the value instead of symbol‘●’, and the num-2 Processber of tokens in a variable place is the current value ofvariable place. Accordingly, there are four kinds of arcs:Vx∈So,r(x)={t| (x, t)∈R}, w(x)={t| (x,control arc represents the relation of control( flow) whicht)∈W), r(x) and w(x) are read-extension and write-denotes the firing of transition will consume the resource;extension of x respectively. .read arc represents read relation which denotes the firingVt∈T, r(t)={v| (v, t)∈R},w(t)={0| (v, t)of transition will read the current value of place but not∈W}, r(t) and w(t) are read- extension and write exten-modify the current value of place; write arc representssion of t respectively. v(t)= r(t)∪w(t) is called V-ex-write relation which denotes the firing of transition willtension of t.modify the current value of place; read-write arc repre-The directed net-3] N= (B, E; F) is a general oc-sents read-write relation which is the combination of acurrence net, if which satisfies the condition F+∩read relation and a write relation. Another extension is(F-1)+=0, where,the semantics of transitions, i. e. variable transition isF+= F∪F°F∪F°F°F∪..,presented additionally. Contrast to variable transition,F1={(x,y)| (y,x)∈F},transition defined in Petri net is called control transition.( F-1)+= F-∪F-°F→∪Control guard determines the firing of control transition.F-1.F-1.F-U..The structure of variable transition is composed of three“。”is a symbol of relation composition.parts: E denotes a control guard- which is same as theA general occurrence net N = (B, E; F), ifx, y .control guard of control transition; B is called variable∈Eorx, y∈B(x≠y), and(x, y)∈F+ , then there isguard which denotes the condition satisfied by variablesa partial order relation between x and y, denoted as x . <( places); A denotes the actionE5.11] .y, or x
-
C4烯烃制丙烯催化剂 2020-11-10
-
煤基聚乙醇酸技术进展 2020-11-10
-
生物质能的应用工程 2020-11-10
-
我国甲醇工业现状 2020-11-10
-
JB/T 11699-2013 高处作业吊篮安装、拆卸、使用技术规程 2020-11-10
-
石油化工设备腐蚀与防护参考书十本免费下载,绝版珍藏 2020-11-10
-
四喷嘴水煤浆气化炉工业应用情况简介 2020-11-10
-
Lurgi和ICI低压甲醇合成工艺比较 2020-11-10
-
甲醇制芳烃研究进展 2020-11-10
-
精甲醇及MTO级甲醇精馏工艺技术进展 2020-11-10