CN103973483A - Web service combination analysis method based on net theory - Google Patents
Web service combination analysis method based on net theory Download PDFInfo
- Publication number
- CN103973483A CN103973483A CN201410173974.XA CN201410173974A CN103973483A CN 103973483 A CN103973483 A CN 103973483A CN 201410173974 A CN201410173974 A CN 201410173974A CN 103973483 A CN103973483 A CN 103973483A
- Authority
- CN
- China
- Prior art keywords
- web service
- petri net
- service combination
- net
- petri
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a web service combination analysis method based on the net theory. The analysis method starts from Petri net modeling of a Web service combination, the boundedness, the accessibility and the activity of the Web service combination are analyzed, and the analysis method based on the Web service combination quality of the Petri net technology is built. The web service combination analysis method based on the net theory adopts the Petri net analysis technology and starts from the two analysis methods of a accessible marking graph and a coverage graph, the boundedness, the accessibility and the activity of the Web service combination are analyzed, and therefore whether the Web service combination is correct or not is determined, and users are better served.
Description
Technical field
The present invention has provided a kind of analytical method of the Web service combination based on Petri net (also referred to as net opinion), mainly solves the quality verification problem of Web service combination, belongs to the development and application field of Web service.
Background technology
Web service be a platform independently, loose coupling, self-contained, application program based on programmable network, can use open these application programs of XML standard to describe, issue, discovery, coordination and configuration, for developing the application program of distributed interoperability.Network service can provide some services in the calculating of some routines, thereby completes a concrete task, processes relevant business or solves a complicated problem.In addition, network service uses (based on XML's) standardized internet language and standardization agreement on internet or in-house network, to show their programmable functions parts, and by self-described Interface realization network service.The Internet Standard of these self-described interfaces based on open.
Web service (WebService, be called for short WS) be a kind of technology of Service-Oriented Architecture Based, Web agreement by standard provides service, adopts modular mode to provide the description to service, and object is the interoperability realizing between the application service of different platform.According to the definition of W3C, Web service should be software systems, in order to the interactive operation of different machines between network enabled.The normally many application programming interfaces of network service form, and the remote server end of for example Internet is carried out the request of service that client submits to.Although many different and systems that cannot cutting are contained in the definition of W3C, but we refer to have about transmitting XML format messages according to SOAP (Simple Object Access Protocol) agreement between master-slave architecture (Client-server) conventionally.No matter define or realize, in Web service process, can provide the Web service of a machine-readable description (conventionally based on WSDL) to distinguish that server is provided by server.Web service, based on XML technology, is used WSDL service is represented and describe, and by the mode of remote procedure call (RPC), utilizes soap message to carry out communicating by letter of client and user side.Web service has shielded the detailed information of application program, directly exports to result, thereby realized the easiest the calling of application program from parameter input.
Along with the fast development of computer networking technology and application, people also further improve the demand of the Internet, wish that the Internet can provide them required various services effectively.But single Web service function singleness, can not provide total solution, in order to realize complicated service logic, just must combine with integrated Web service, the target of Web service combination is exactly the integrated and cooperation problem solving between them.Web service combination can be a new service by multiple Services Compositions, has improved the reusability of service, and can realize " on-demand service " according to the variation of operation flow.Web service is combined as a kind of way of realization across organization business flow process, has obtained numerous concerns, becomes the study hotspot of domestic and international industrial quarters and academia.What Web service combinatorial surface was right is that distribute, isomery, the dynamic environment of a wide area, and relates to the mutual and cooperation between multiple autonomy organizations, and such environment has brought huge challenge to Web service combination.
The tolerance of service is a hot topic of studying in Web service, and the quality of the quality of a service is directly connected to the accuracy of service result and calls the efficiency of service.In recent years, many researchers are based on the essence of service, are about to a service and regard the software that can move as, go to evaluate the quality of a service from software metrics angle.There is scholar to propose to describe with Petri net the system of various labyrinths, and introduce a kind of bottom-up Calculation of Reliability process, this process can be decomposed and COMPREHENSIVE CALCULATING parallel organization, calculate efficiently and accurately the reliability of system, the method is started with from taking into account this two aspect of efficiency and the scope of application, estimate the importance of assembly to system, thereby greatly strengthened the effect of reliability assessment in the time of service measure.
We use Petri net analytical technology in the present invention.Petri net is for describing directly perceived, the understandable patterned mathematical modeling instrument of having of distributed system.It can not only descriptive system structural property, operation that again can analogue system, can react the practical operation situation of a complication system dynamically.In the time of the order for the treatment of system, concurrent, conflict and the problem such as synchronous, there is obvious structuring and patterned advantage.Since Germany scientist CarlAdamPetri in 1962 proposes the concept of Petri net first, through the development of 50 years, Petri net has formed a systematized special disciplines branch with unique advantage, is widely used and develops in each scientific method fields such as computer operating system, discrete event dynamic system, flexible manufacturing system, automation scientific method, artificial intelligence.
Petri net is a kind of patterned mathematical modeling instrument with easy to learn, understandable and easy-to-use advantage, being widely used in describing and research has the information processing system of the features such as concurrent, asynchronous, parallel, uncertainty and randomness, is the very effective modeling analysis instrument being proved to be.First, in Petri net, can introduce mathematical method, utilize the general principle of mathematical knowledge to analyze dynamic behaviour and the static structure of Petri net.Petri pessimistic concurrency control both can form incidence matrices by one group of linear algebraic equation group to be described, again can be by carry out the behavior of effective descriptive system by other Mathematical Modelings, and therefore Petri pessimistic concurrency control is again a kind of very effective mathematical modeling instrument.Reachable states graph, incidence matrices and state equation, P-invariant, T-invariant, deadlock, trap, coverability tree etc. method is the topmost Petri pessimistic concurrency control analytical method obtaining under a lot of older generation scholars' research.Secondly, Petri net is as the patterned modeling tool of one, some main informations in the use evolution process expression system running of figure that can be vivid, what Petri netted is graphically an oriented bigraph (bipartite graph), in figure, formed by two kinds of node storehouses institute and transition and directed arc, between storehouse institute and transition, be connected by directed arc, between two storehouse institutes or two transition, do not allow arc, in the time of mapping, we are circle library representation institute for general custom, rectangle represents transition, and we can storehouse in configure different token numbers, carry out the dynamic operation of better analogue system.This is a kind of formal describing method, and is widely used at aspects such as model analysis, protocol verification, the project evaluation, decision model and communication protocols.
Utilize Petri net to carry out modeling to real system and performance evaluation has a lot of advantages, wherein one of most important advantage is that Petri net can provide a patterned modeling tool, completes this process that realizes from the initial designs of system to systematic function.
First, the formalized description that Petri net provides is accurately, and this just makes harmony between designer, owner and user three, realizes cooperation between them smooth and easy.Secondly, because Petri netting gear has good theoretical system, can realize the Rational Model to real system, and can provide strong checking at the aspect such as such as activity, fairness, boundedness of analytical system.
As a patterned mathematical modeling instrument, Petri net can effectively be applied in modeling, formalization analysis and the design of discrete event system, and a unified best solution can be provided.The advantage that uses Petri net to carry out modeling is that behavior character that it not only can analytical system is entered and the evolution process of performance, also can show structural property when discrete event system is simulated and controlled.The main contents of Petri net theoretical research comprise system invertibity, boundedness, accessibility, can spreadability, activity, fairness, deadlock and trap etc.Chinese scholars is netted theoretical research to Petri and is mainly concentrated on deadlock and accessibility aspect at present.
List of references:
Hui Xiu. the condition research of Fuzzy Petri Net system and the application [D] in information processing thereof. Electronic University Of Science & Technology Of Hangzhou, 2012.
Guo Feng, Wei Guang. based on Web service description and the replaceability analysis [J] thereof of Petri net. computer integrated manufacturing system, in June, 2013,19 (6): 1423-1432.
Summary of the invention
Technical problem: the object of the invention is to propose a kind of Web service analytical method based on Petri network technology.Main purpose is to provide a kind of practical and effective analytical method Web service combination quality is analyzed.
Technical scheme: the analytical method that the present invention proposes a kind of combination of the Web service based on Petri network technology, this analytical plan is started with from the Petri net modeling of Web service combination, Web service combination after modeling is analyzed, built the analytical method of the Web service combination quality based on Petri network technology.The residing network environment of Web service is an isomery, distributed autonomy and the fast dynamic environment of Change and Development. the isomerism of network environment, the characteristics such as distributed autonomy have determined that Services Composition may be subject to the variation of communication pattern in the process of implementation, network failure, service-denial is attacked, the impact of the problems such as infrastructure inefficacy. the autonomy of Component service, platform independence and the renewal of self all may cause original service operations to be lost efficacy with upgrading, even occur that service is unavailable, this all will affect the normal operation of Services Composition, and can cause the waste of a lot of Internet resources, therefore we have proposed a kind of analytical method for Web service combination quality based on Petri network technology, to Web service compositional modeling, and obtain combination workflow, according to workflow, use Petri network technology to analyze Web service combination quality, wish to pass through the analysis result to Web service combination quality, and then it is more reliable to allow user select, the Web service combination that quality is higher.
Whether Web service combination can normal termination, need to verify activity and the boundedness of composite services net system by Petri net, if this Petri net is not active and unbounded, this Web assembled scheme is irrational so; Carry out and whether there is boundedness, accessibility and activity by analysis Petri net the correctness that the service for checking credentials is combined, if some state in this Petri net can not reach, some transition can not be excited and exist endless loop, and these composite services are incorrect equally so.Provide the satisfied condition of Services Composition correctness below:
Services Composition is correct, and the Petri netting gear that and if only if is built by it has activity, boundedness, accessibility.
It is many that analysis Petri nets adoptable method, many having of use: reachability tree method, yojan, invariant etc.Wherein analytical Methods for Reachable Trees has ocular and simple, and the various behavioral characteristics such as the accessibility of analytical system, boundedness, activity are very convenient, so carry out some characteristics of analytical model here by analytical Methods for Reachable Trees.
The present invention proposes a kind of analytical method of the Web service combination quality based on Petri network technology, the quality of Web service combination is carried out, be intended to guarantee the quality of Web service combination, thereby can select better Web service combination for user.Petri net analytical method in the present invention comprises Petri net MBM, reachable state analysis module.The present invention first combines Web by the modeling of Petri net, then whether the Petri net after analysis modeling has accessibility, boundedness and activity, if have three above character, we can verify that Web combination is correct feasible so, and the quality of Web service combination can be guaranteed.
The analytical method of a kind of combination of the network service based on net opinion of the present invention is started with from the Petri net modeling of Web service combination, Web service combination after modeling is carried out to boundedness, accessibility and activity analysis, build the analytical method of the Web service combination quality based on Petri network technology, in the method, use Petri net analytical technology, start with from reachable marking graph and two analytical methods of coverage diagram, analyze the boundedness of Web service combination, accessibility and activity, thereby determine whether Web service combination is correct, can serve better for user, the method specifically comprises following steps:
Step 1): choose a Web service combination;
Step 2): the place of the storehouse institute circle that atomic service is labeled as to Petri net represents;
Step 3): by the transition transition that is labeled as alternately Petri net between atomic service, represent with rectangle;
Step 4): the data of Services Composition requirements of process input is labeled as to holder and agree token, with pore mark in the institute of storehouse;
Step 5): storehouse is connected with directed arc with transition;
Step 6): complete the modeling of Petri net;
Step 7): judge that whether the Petri net after modeling meets abbreviation rule, goes to step 9 if do not met);
Step 8): if the Petri net after modeling meets abbreviation rule, adopt simplifying method to its abbreviation;
Step 9): by one hexa-atomic group N=(P, T for model after transforming; F, K, W, M
0) represent, P, T, F is library representation institute respectively, transition and directed arc, K, W, M
0be followed successively by the capacity function on N, weight function and initial marking;
Step 10): build the reachable marking graph of Petri net, according to the definition of boundedness and accessibility, if reachable marking graph is bounded, Petri net is bounded; If any state M
tcan be from M
0trigger and arrive through a series of transition, Petri net meets accessibility; M
tt state, M
0it is initial condition;
Step 11): build the coverage diagram of Petri net, judge according to coverage diagram whether each transition are alive, thereby judge the activity of Petri net;
Step 12): combining step 10) and step 11) result, draw the analysis result of Web service combination.
Beneficial effect: as the method for analyzing Web service combination, the present invention has ensured the correctness of service.There is following Some features and innovation:
1) the present invention adopts the method that Petri net reachable marking graph and coverage diagram combine, and not only analyzes boundedness, the accessibility that can analyze Petri net, can also analyze the activity of transition.
2) the present invention has adopted relevant Petri net reduction technology, also can effectively analyze more complicated Web service combination.
Brief description of the drawings
Fig. 1 is the overall flow block diagram of the analytical method of the Web service combination based on Petri net.
Fig. 2 is the corresponding relation of Petri net and Web service.
Fig. 3 is the abbreviation rule of Petri pessimistic concurrency control.
Embodiment
In this patent, we use Petri net analytical technology, start with from reachable marking graph and two analytical methods of coverage diagram, analyze boundedness, accessibility and the activity of Web service combination, thereby determine whether Web service combination is correct, can serve better for user.Mainly contain following several step:
Step 1): choose a Web service combination;
Step 2): the storehouse institute (place) that atomic service is labeled as to Petri net represents with circle;
Step 3): by the transition (transition) that are labeled as alternately Petri net between atomic service, represent with rectangle;
Step 4): the data of Services Composition requirements of process input is labeled as to Tuo Ken (token), with pore mark in the institute of storehouse;
Step 5): storehouse is connected with directed arc with transition;
Step 6): complete the modeling of Petri net;
Step 7): judge that whether the Petri net after modeling complicated, go to step 9 if fairly simple);
Step 8): if the Petri net more complicated after modeling, employing simplifying method is below to its abbreviation.
Abbreviation rule: every middle database that only has input and output can be absorbed, and by the task merging of next stage to upper level.
Through storehouse Subsumption rule Petri net is absorbed and is processed after, the quantity of middle database institute and transition greatly reduces.Therefore, absorb for system model larger and that meet Subsumption rule that to process be highly significant, saved a large amount of amounts of calculation.
Step 9): by one hexa-atomic group N=(P, T for model after transforming; F, K, W, M
0) represent K, W, M
0be followed successively by the capacity function on N, weight function and initial marking; For Petri net (P, T; F, K, W, M
0), have following task that rule occurs:
1), for task t ∈ T, if p ∈ is t, M (p) >=1, claim M to authorize (enable) t to occur, or t is (enabled) enabling, and is denoted as M[t >;
2) if the new logo obtaining from M generation t is M',, to p ∈ P, have
Be designated as M[t > M'.Wherein: t represents the preposition collection of t, expression input magazine is gathered; T represents the post set of t, represents to export storehouse and gathers.
Step 10): build the reachable marking graph of Petri net, analyze boundedness, the accessibility of Petri net;
Definition: boundedness, establish Petri net system N=(P, T; F, K, W, M
0), p ∈ P, if there is positive integer B, makes M ∈ R (M arbitrarily
0), there is M (p)≤B, claim that the p of this storehouse institute is bounded (bounded).If to (p ∈ P is bounded, claims that this Petri net system is BOUNDED PETRI NETS.Especially, in the time of B=1, the p of storehouse institute is safe (safe).
Definition: establish N={P, T; F, if M} is a Petri net. have t ∈ T, M[t > M', claims M' directly can reach from M; If there is task sequence t
1t
2t
kwith identifier M
1m
2m
3m
k, make M[t
1> M
1[t
2> M
2m
k_
1[t
k> M
k, claim M
kcan reach from M. the set of all marks that can reach from M be designated as R (M) if. note transition sequence t
1t
2t
3t
kfor σ, can be by M[t
1> M
1[t
2> M
2m
k_ 1[t
k> M
kbe designated as M[σ > M
k
Definition: accessibility, Services Composition flow process must comprise one and only have an inputplacei and an outplaceo, in initial initial state, only have inputplacei to have a token, remaining place does not all have token, in the end done state, token must can arrive outplaceo, and other place can not have token.
Services Composition demand model is a dynamic directed graph, storehouse in Tuo Ken along with the generation of task, flow to output storehouse from input magazine institute, thereby cause the variation of mark, the evolution of promotion net system.If any one mark is all can be from M in the Petri of composite services net
0can reach, any one state of these composite services is all from M
0can reach, this Web service combination is exactly bounded, can reaches so.
Construct one taking initial marking as root knot, under the promotion of task that has concession, produce the algorithm of the reachability tree (ReachableTree) to be designated node.
The construction algorithm of the reachability tree of algorithm 1Petri net
Input: N=(P, T, F, M
0, M
t);
Output: RT (N);
Step1: according to storehouse institute Subsumption rule, master mould is simplified;
Step2: with M
0as the root node of RT (N), and mark with " newly ";
Step3:while exists and is labeled as " newly " node, and the optional node that is labeled as " newly " of Do, is made as M;
Step4:If is from M
0equal MThen to the mark that has a node on the Oriented Path from Its Maximal Subtrees of M the mark of M is changed into " old ", proceed to Step3;
Step5:IfM=M
tthen changes the mark of M as " end points " into, proceeds to Step3;
The each t ∈ TDo that meets M[t > of step6:For
1) calculate the M' in M[t > M';
2) in RT (N), introduce " newly " node M', from M to M', draw a directed arc, and be marked with t on this arc side, wipe the mark of node M " newly ", proceed to Step3.
Algorithm 1, from initial marking, moves Petri net system, and the new mark that generation task is at every turn produced, as child node, is target identification position until run to leafy node.
Step 11): build the coverage diagram of Petri net, analyze the activity of transition in Petri net;
Definition: activity, establish Petri net system N=(P, T, F, M
0), M
0for initial marking,, if to any M ∈ R (M), there is M ' ∈ R (M) in t ∈ T, makes M'[t>, claims that transition t is (live) living.If be all alive to t ∈ T, claim that net system is the Petri net of living.
The coverability tree of Petri net has shown the state (node of tree) likely arriving in this net and the migration (mark of arc) enabling. mark w: in order to represent unbounded mark, represent " infinitely " positive integer with w.
If (N, M
0) be Petri net, (N, M
0) coverability tree T generate according to following algorithm.
Algorithm 2 coverability tree generating algorithms:
Step1: initial condition is made as to root node, and is labeled as " new ";
Step2: if current existence is labeled as the node of " new ", do:
Step2.1: select a node M that is labeled as " new ";
Step2.2: if state M is identical with the state that certain node on road from root node to M represents, M is labeled as " old ", and continues to select again a node that is labeled as " new ";
Step2.3: if under state M, without any the migration enabling, M is labeled as " dead-end ";
Step2.4: to each migration t enabling under state M, do:
Step2.4.1: the new state M that obtains moving under state M the rear migration of t igniting
￡;
Step2.4.2: on the road from root node to M, if there is M
￡ ￡, make M
￡>=M
￡ ￡, and to " p ∈ P, M
￡(p)>=M
￡ ￡(p), to meeting M
￡(p) >M
￡ ￡(p) each p ∈ P, replaces M with w
￡(p);
Step2.4.3: by M
￡as a new node, and from M to M
￡draw a directed arc that is labeled as t.
Can produce the concept of coverability graph from coverability tree.Petri net (N, M
0) coverability graph be a mark directed graph G=(V, E), its node set V is all different nodes in coverability tree T, directed arc set E is with single migration t in T
kthe set of the arc of mark, moves t herein
krepresentative meets all possible single migration of following condition: M
i[t
k>M
j, M
i, M
j∈ V.
Whether activity expression all there is potential concession for all reachable markings, and when transition can trigger in no instance, it is a dead transition.Obviously, if all transition can be from M
0start, be excited at least once, so the Petri net of these composite services is that tool is activated.
Step 12): according to step 10) and step 11), sum up the analysis result that draws Web service combination.
Claims (1)
1. the analytical method of the combination of the network service based on net opinion, it is characterized in that this analytical method starts with from the Petri net modeling of Web service combination, Web service combination after modeling is carried out to boundedness, accessibility and activity analysis, build the analytical method of the Web service combination quality based on Petri network technology, in the method, use Petri net analytical technology, start with from reachable marking graph and two analytical methods of coverage diagram, analyze the boundedness of Web service combination, accessibility and activity, thereby determine whether Web service combination is correct, can serve better for user, the method specifically comprises following steps:
Step 1): choose a Web service combination;
Step 2): the place of the storehouse institute circle that atomic service is labeled as to Petri net represents;
Step 3): by the transition transition that is labeled as alternately Petri net between atomic service, represent with rectangle;
Step 4): the data of Services Composition requirements of process input is labeled as to holder and agree token, with pore mark in the institute of storehouse;
Step 5): storehouse is connected with directed arc with transition;
Step 6): complete the modeling of Petri net;
Step 7): judge that whether the Petri net after modeling meets abbreviation rule, goes to step 9 if do not met);
Step 8): if the Petri net after modeling meets abbreviation rule, adopt simplifying method to its abbreviation;
Step 9): by one hexa-atomic group N=(P, T for model after transforming; F, K, W, M
0) represent, P, T, F is library representation institute respectively, transition and directed arc, K, W, M
0be followed successively by the capacity function on N, weight function and initial marking;
Step 10): build the reachable marking graph of Petri net, according to the definition of boundedness and accessibility, if reachable marking graph is bounded, Petri net is bounded; If any state M
tcan be from M
0trigger and arrive through a series of transition, Petri net meets accessibility; M
tt state, M
0it is initial condition;
Step 11): build the coverage diagram of Petri net, judge according to coverage diagram whether each transition are alive, thereby judge the activity of Petri net;
Step 12): combining step 10) and step 11) result, draw the analysis result of Web service combination.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410173974.XA CN103973483A (en) | 2014-04-28 | 2014-04-28 | Web service combination analysis method based on net theory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410173974.XA CN103973483A (en) | 2014-04-28 | 2014-04-28 | Web service combination analysis method based on net theory |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103973483A true CN103973483A (en) | 2014-08-06 |
Family
ID=51242550
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410173974.XA Pending CN103973483A (en) | 2014-04-28 | 2014-04-28 | Web service combination analysis method based on net theory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103973483A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104317885A (en) * | 2014-10-22 | 2015-01-28 | 安徽师范大学 | Minimum spanning workflow net method by determining evolution domain |
| CN105468845A (en) * | 2015-11-24 | 2016-04-06 | 浪潮(北京)电子信息产业有限公司 | XML (Extensive Markup Language)-based Petri net operation method and system |
| CN112182918A (en) * | 2020-08-17 | 2021-01-05 | 北京航空航天大学 | Flexible modeling method for research and development design workflow based on object-oriented hierarchical Petri network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060242002A1 (en) * | 2005-04-26 | 2006-10-26 | Xerox Corporation | Validation and analysis of JDF workflows using colored Petri nets |
| CN102103519A (en) * | 2009-12-21 | 2011-06-22 | 同济大学 | Method for optimizing Web service execution based on scripts |
-
2014
- 2014-04-28 CN CN201410173974.XA patent/CN103973483A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060242002A1 (en) * | 2005-04-26 | 2006-10-26 | Xerox Corporation | Validation and analysis of JDF workflows using colored Petri nets |
| CN102103519A (en) * | 2009-12-21 | 2011-06-22 | 同济大学 | Method for optimizing Web service execution based on scripts |
Non-Patent Citations (3)
| Title |
|---|
| 张佩云等: "基于Petri网的Web服务组合模型描述与验证", 《系统仿真学报》 * |
| 张金朋: "基于Petri网的动态Web服务组合分析与验证", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
| 徐誉尹: "Petri网活性判断方法的探讨", 《中国优秀博硕士学位论文全文数据库（硕士）信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104317885A (en) * | 2014-10-22 | 2015-01-28 | 安徽师范大学 | Minimum spanning workflow net method by determining evolution domain |
| CN104317885B (en) * | 2014-10-22 | 2017-09-19 | 安徽师范大学 | A kind of minimum generation Workflow net method for determining evolution domain |
| CN105468845A (en) * | 2015-11-24 | 2016-04-06 | 浪潮(北京)电子信息产业有限公司 | XML (Extensive Markup Language)-based Petri net operation method and system |
| CN105468845B (en) * | 2015-11-24 | 2018-12-07 | 浪潮(北京)电子信息产业有限公司 | A kind of Petri network operation method and system based on XML |
| CN112182918A (en) * | 2020-08-17 | 2021-01-05 | 北京航空航天大学 | Flexible modeling method for research and development design workflow based on object-oriented hierarchical Petri network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Syriani et al. | A modular timed graph transformation language for simulation-based design | |
| Wainer | CD++: a toolkit to develop DEVS models | |
| Zacharewicz et al. | G-DEVS/HLA environment for distributed simulations of workflows | |
| Sadoghi et al. | Safe distribution and parallel execution of data-centric workflows over the publish/subscribe abstraction | |
| CN101673198A (en) | Method for verifying consistency of dynamic behavior in UML model and time-sequence contract | |
| CN102253974B (en) | Dynamic combination method for geographic model network services | |
| Andres et al. | Symbolic system synthesis using answer set programming | |
| Fard et al. | Coupling weap and leap models using interaction modeling | |
| Tsigkanos et al. | Dependable resource coordination on the edge at runtime | |
| CN103973483A (en) | Web service combination analysis method based on net theory | |
| Pagliari et al. | Engineering cyber‐physical systems through performance‐based modelling and analysis: A case study experience report | |
| Xiong et al. | Construction of approximate reasoning model for dynamic CPS network and system parameter identification | |
| Zhao et al. | Agent-based simulation platform for cloud manufacturing | |
| CN104267936A (en) | Semantic tree based asynchronous dynamic push-down network reachability analysis method | |
| CN106096159A (en) | Distributed system behavior simulation under a kind of cloud platform analyzes the implementation method of system | |
| Sacco et al. | Supporting the design of AAL through a SW integration framework: the D4All project | |
| CN113010296A (en) | Task analysis and resource allocation method and system based on formalized model | |
| Mittal et al. | Implementation of formal standard for interoperability in M&S/systems of systems integration with DEVS/SOA | |
| CN102594851A (en) | Method for dynamically building marine application service chain | |
| Balsamo et al. | Software performance: state of the art and perspectives | |
| Di Martino et al. | A platform for mbdaaas based on patterns and skeletons: The python based algorithms compiler | |
| Bock et al. | Conceptual modeling | |
| Prackwieser et al. | Overcoming heterogeneity in business process modeling with rule-based semantic mappings | |
| Luo et al. | Towards efficient verification for process composition of semantic web services | |
| Xie et al. | Agent-based Simulation with Process-interaction Worldview. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140806 |