CN102043681A - Distribution type flow verification system and method based on Pi calculus - Google Patents
Distribution type flow verification system and method based on Pi calculus Download PDFInfo
- Publication number
- CN102043681A CN102043681A CN 201010609285 CN201010609285A CN102043681A CN 102043681 A CN102043681 A CN 102043681A CN 201010609285 CN201010609285 CN 201010609285 CN 201010609285 A CN201010609285 A CN 201010609285A CN 102043681 A CN102043681 A CN 102043681A
- Authority
- CN
- China
- Prior art keywords
- calculation
- deadlock
- flow process
- bpel
- name
- 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
Images
Abstract
The invention discloses a distribution type flow verification system based on Pi calculus, at least comprising the following modules: a business process execution language (BPEL) editing module, a business process execution language (BPEL) to Pi calculus conversion module, a Pi calculus editing module, a Pi calculus verification module and a deadlock reason display module which are sequentially connected. A verification method provided by the invention comprises the following steps of: describing flows to be deployed by using a BPEL; converting the flows described by the BPEL to obtain a plurality of Pi calculus flows; rewriting the obtained Pi calculus flows; carrying out deadlock inspection by adopting the protocol theory of the Pi calculus; and explaining a deadlock state by using a text file. By using the distribution type flow verification system based on Pi calculus, whether deadlock exists in the distribution type flows described by the BPEL can be verified, deadlock positions can be accurately located, and the correctness of flow operation is ensured after the flows are deployed to a real environment.
Description
Technical field
The invention belongs to workflow and field of computer technology, be specifically related to a kind of the checking with the flow process of BPEL language description correct method whether, particularly a kind of distributed flow process verification system and method based on the Pi calculation, this method can verify that whether having deadlock when the concurrent propelling of a plurality of flow processs takes place, and provides the deadlock occurrence cause.
Background technology
Along with the globalization of economy, the variation of business model and organizational form, that flow process has occurred is distributed, stride characteristics such as tissue, multitask cooperation, workflow management has been proposed new demands such as dirigibility and movability.The main language of the distributed flow process of exploitation is BPEL at present, after a new flow process is developed, in order to guarantee the correctness of flow process in actual motion, flow process must be verified before disposing, but since business model distributed, stride tissue, multitask and cooperate, make the checking of flow process become very difficult.
At present about a lot, the popular verification method that is based on the Petri net of the checking research of flow process.The Petri net has precise definition, can carry out qualitative and quantitative analysis to workflow and Workflow system, and this makes the Petri net become one of main modeling technique.Abroad, Aalst etc. has carried out deep research to Petri net Work flow model.At home, Fan Yushun, suyou li, a lot of useful work have also been done by Northwest University Software Engineering Institute etc.The correctness that the Petri netting gear has abundant analytical technology can help deterministic process to design, but the Petri net is because the movability that is beyond expression can not be verified distributed, multitask collaboration process.
The Pi calculation is theoretical to be suitable for describing the movability paid more and more attention because of it, at present a lot of people attempt with Pi calculation checking distributed work flow, but these checkings all stay in the manual stage, about how with computing machine assist people verify whether can produce of deadlock with the flow process of BPEL language description method also do not have at present.
Summary of the invention
Defective or deficiency at above-mentioned prior art existence, the objective of the invention is to, a kind of distributed flow process verification system and method based on the Pi calculation is provided, the present invention has overcome defective or the deficiency that stays in the manual stage at present with checking in the Pi calculation checking distributed workflow, in verification system of the present invention, use verification method, can verify whether the distributed flow process with the BPEL language description exists deadlock, and accurately locate deadlock position, find out or find because flow scheme design incorrect, when the flow process of concurrent cooperation deadlock can occur somewhere when advancing, and design cycle again, thereby guarantee after flow process is deployed to true environment the correctness of process flow operation.
In order to realize above-mentioned task, the present invention takes following technical solution:
A kind of distributed flow process verification system based on the Pi calculation is characterized in that described verification system comprises at least as lower module:
BPEL language editor module is used for developing the BPEL flow process that is verified;
The BPEL language is to the modular converter of Pi calculation, and the BPEL flow process that is used for being developed is converted to the Pi calculation;
Pi calculates editor module, is used for the Pi calculation after changing is rewritten;
Pi calculates authentication module, is used for the Pi calculation formula that generates is verified: each the Pi calculation formula after the conversion is used as a process, then all processes is advanced jointly, judged whether that by the communication between process the flow process deadlock takes place;
Deadlock reason display module is used for showing the text of explaining deadlock state;
Described BPEL language editor module, BPEL language are connected with deadlock reason display module successively to modular converter, Pi calculation editor module, the Pi calculation authentication module of Pi calculation, in Pi calculation authentication module, judge whether there is deadlock in the distributed flow process by the process communication of each module between mutually, and in deadlock reason display module by showing that the text of explaining deadlock state locatees deadlock position.
Further, described flow process deadlock has following feature:
A, in flow process advances, flow process can't be communicated by letter with other flow processs, but also has at least a flow process can not finally arrive abort state;
B, in flow process advances, though can also communication between the flow process, have flow process constantly to repeat to get back to a certain intermediateness more than one.
A kind of method of utilizing based on the distributed flow process verification system of Pi calculation is characterized in that, comprises the steps:
Step 1, the flow process that BPEL language editor module will be disposed with the BPEL language description;
Step 2, the BPEL language, obtains several Pi and calculates flow process changing with the flow process of BPEL language description to the modular converter of Pi calculation;
Step 3, Pi calculation editor module is rewritten the Pi calculation flow process that obtains;
Step 4, Pi calculation authentication module adopts the stipulations theory of Pi calculation to carry out deadlock detection;
Described flow process deadlock has following feature: in flow process advanced, flow process can't be communicated by letter with other flow processs, but also has at least a flow process can not finally arrive abort state; Perhaps, in flow process advances, can communication though change between the flow process, constantly repeat to get back to a certain intermediateness.
Step 5, deadlock reason display module is explained deadlock state with text, the location deadlock position.
Further, the transfer process of described step 2 specifically comprises the steps:
Step 201: read in whole BPEL file;
Step 202: the procedure name of process label correspondence in the BPEL file is calculated process name as a Pi;
Step 203: scan whole BPEL file, find out active tags arranged side by side and treatment mechanism label, each active tags name and treatment mechanism tag name are calculated process name, the concurrent defined content of process as process tag name correspondence of all these processes and a receiving process as a Pi.
Step 204: whether the active tags in the determining step 203 is structurized activity, if then the text between the Scan Architecture activity changes step 206 conversion over to, otherwise changes step 205 over to, up to the concurrent basic activity that all becomes of process;
Step 205: each basic activity is used as a Pi calculation process, and the Pi calculation that provides each basic activity is described.
Step 206: extract tag name arranged side by side between the structured activities, change step 203 over to, each active tags name and treatment mechanism tag name are calculated process name as a Pi.
Further, the Pi calculation editor module of described step 3 is rewritten the Pi calculation flow process that obtains, be meant process name and passage name in the Pi calculation formula that obtains to the modular converter of Pi calculation through the BPEL language are rewritten, phrases such as the describing activity of using in the BPEL language, process, message are rewritten as the English alphabet of upper case or lower case, and adopt the form of note to note.
Further, the Pi of described step 4 calculation authentication module adopts the stipulations theory of Pi calculation to carry out deadlock detection specifically to comprise the steps:
Step 401: each Pi calculation formula is regarded as an independent process;
Step 402: judge that these processes whether can reduction, if can, change step 404 over to; Otherwise change step 403 over to;
Step 403: if can not, judge whether all processes arrive abort state, if whether arrive abort state, then deadlock takes place, and notes current all states of a process, and state of a process before.Otherwise do not have deadlock fair termination takes place.
Step 404: if can stipulations, judge whether that the state that arrives more than a process is certain intermediateness that arrived in the past, if then deadlock takes place, and notes current all states of a process, and state of a process before.Otherwise change step 405 over to;
Step 405: the reduction rule by the Pi calculation carries out stipulations, and goes back to step 402, up to there being deadlock to take place or fair termination.
Further, the deadlock reason display module of described step 5 is to adopt text to make an explanation, and, that is to say that, passage name bright the process in the deadlock according to the rewriting note of step 3 changes the term in the BPEL language into the term description deadlock reason in natural language and the BPEL file.
Further, described text is meant the file of suffix .txt by name.
Description of drawings
Fig. 1 is the structural representation of the distributed flow process verification system based on Pi calculation of the present invention;
Fig. 2 is the process flow diagram of the distributed flow process authentication method based on Pi calculation of the present invention;
Fig. 3 is the flow path switch figure of the calculation from the BPEL language to Pi of step 2 of the present invention;
Fig. 4 is the deadlock detection process flow diagram of step 4 of the present invention.
Below in conjunction with drawings and Examples the present invention will be further explained explanation.
Embodiment
Referring to Fig. 1, the distributed flow process verification system that the present invention is based on the Pi calculation comprises at least as lower module:
BPEL language editor module is used for developing the BPEL flow process that is verified;
The BPEL language is to the modular converter of Pi calculation, and the BPEL flow process that is used for being developed is converted to the Pi calculation.
Pi calculates editor module, is used for the Pi calculation after changing is rewritten.
Pi calculates authentication module, is used for the Pi calculation formula that generates is verified: each the Pi calculation formula after the conversion is used as a process, allows all processes advance jointly then, judged whether that by the communication between process the flow process deadlock takes place;
Deadlock reason display module is used for showing the text of explaining deadlock state;
Described BPEL language editor module, BPEL language are connected with deadlock reason display module successively to modular converter, Pi calculation editor module, the Pi calculation authentication module of Pi calculation, in Pi calculation authentication module, judge whether there is deadlock in the distributed flow process by the process communication of each module between mutually, and in deadlock reason display module by showing that the text of explaining deadlock state locatees deadlock position.
Described flow process deadlock has following feature:
A, in flow process advances, flow process can't be communicated by letter with other flow processs, but also has at least a flow process can not finally arrive abort state;
B, in flow process advances, though can also communication between the flow process, have flow process constantly to repeat to get back to a certain intermediateness more than one.
Utilization of the present invention comprises the steps: based on the method for the distributed flow process verification system of Pi calculation
Step 1, the flow process that BPEL language editor module will be disposed with the BPEL language description;
Step 2, the BPEL language, obtains several Pi and calculates flow process changing with the flow process of BPEL language description to the modular converter of Pi calculation;
Step 3, Pi calculation editor module is rewritten the Pi calculation flow process that obtains;
Step 4, Pi calculation authentication module adopts the stipulations theory of Pi calculation to carry out deadlock detection; If deadlock is arranged, tell the user that deadlock is arranged; If no, then the user can dispose flow process in actual environment.
Described flow process deadlock has following feature: in flow process advanced, flow process can't be communicated by letter with other flow processs, but also has at least a flow process can not finally arrive abort state; Perhaps, in flow process advances, though all right communication between the flow process constantly repeats to get back to a certain intermediateness.
Step 5, deadlock reason display module is explained deadlock state with text, the location deadlock position.
The transfer process of step 2 specifically comprises the steps:
Step 201: read in whole BPEL file;
Step 202: the procedure name of process label correspondence in the BPEL file is calculated process name as a Pi;
Step 203: scan whole BPEL file, find out active tags arranged side by side and treatment mechanism label, each active tags name and treatment mechanism tag name are calculated process name, the concurrent defined content of process as process tag name correspondence of all these processes and a receiving process as a Pi.
Step 204: whether the active tags in the determining step 203 is structurized activity, if then the text between the Scan Architecture activity changes step 206 conversion over to, otherwise changes step 205 over to, up to the concurrent basic activity that all becomes of process;
Step 205: each basic activity is used as a Pi calculation process, and the Pi calculation that provides each basic activity is described;
Step 206: extract tag name arranged side by side between the structured activities, change step 203 over to, each active tags name and treatment mechanism tag name are calculated process name as a Pi.
The Pi calculation editor module of step 3 is rewritten the Pi calculation flow process that obtains, be meant process name and passage name in the Pi calculation formula that obtains to the modular converter of Pi calculation through the BPEL language are rewritten, phrases such as the describing activity of using in the BPEL language, process, message are rewritten as the English alphabet of upper case or lower case, and adopt the form of note to note.
The Pi calculation authentication module of step 4 adopts the stipulations theory of Pi calculation to carry out deadlock detection, specifically comprises the steps:
Step 401: each Pi calculation formula is regarded as an independent process;
Step 402: judge that process whether can reduction, if can, change step 404 over to; Otherwise change step 403 over to;
Step 403: judge whether all processes arrive abort state, if whether arrive abort state, then deadlock takes place, and notes current all states of a process, and state of a process before; Otherwise do not have deadlock fair termination takes place.
Step 404: if can stipulations, judge whether that the state that arrives more than a process is certain intermediateness that arrived in the past, if then deadlock takes place, and notes current all states of a process, and state of a process before; Otherwise change step 405 over to;
Step 405: the reduction rule by the Pi calculation carries out stipulations, and goes back to step 402, up to there being deadlock to take place or fair termination.
The deadlock reason display module of step 5 is to adopt text to make an explanation, and, that is to say that, passage name bright the process in the deadlock according to the rewriting note of step 3 changes the term in the BPEL language into the term description deadlock reason in natural language and the BPEL file.Text is meant the file of suffix .txt by name.
Below be the preferred embodiment of the method for the present invention that provides of inventor, need to prove, the invention is not restricted to these embodiment.
At BPEL language editor module, design a flow process by the user with the BPEL language, the user also can import a BPEL flow process that has designed.
At the modular converter of BPEL language,, be converted into several Pi calculation processes at the BPEL flow process that has designed to the Pi calculation.
At Pi calculation editor module, the Pi calculation process that has transferred is rewritten, substitute BPEL activity name and the message name that occurs in the process with capitalization and small letter English alphabet.
In Pi calculation authentication module, resulting Pi calculation process is carried out stipulations, judge that deadlock takes place.
Position and reason that last deadlock reason display module takes place to the user report deadlock.
With reference to Fig. 2, Fig. 2 is the flow path switch figure of the calculation from the BPEL language to Pi.
At first read in a BPEL file.The procedure name of the process label correspondence in the extraction document is as Pi calculation process then, extract the process label between tag name arranged side by side because identical label can repeatedly occur, so each mark mirror name is added after the sequence number as process.All have added the content of process of the concurrent process of regarding as label definition of the label of sequence number.Check whether concurrent process name is the structured activities of BPEL.If, extract the structured activities label between tag name arranged side by side, turn back to each mark mirror name added after the sequence number that as process, all have added the concurrent content of regarding the process of this structured activities label definition as of the label of sequence number then; Otherwise provide the Pi calculation formula of basic activity.
With reference to Fig. 3, Fig. 3 is the deadlock detection process flow diagram.
At first read in all Pi calculation formula, judge that then these formula whether can stipulations, if can not through rewriting.Judge whether all processes arrive final state, if then represent no deadlock, fair termination.Otherwise thinking has deadlock to take place.If these formula can stipulations, if the intermediateness that judges whether to have at least two processes to arrive before arriving is if then expression has deadlock to take place.Otherwise, carry out stipulations between process according to the stipulations theory of Pi calculation, whether turn back to these formula then can stipulations, and up to having deadlock to occur or just stopping, then proof procedure finishes.
Claims (8)
1. distributed flow process verification system based on Pi calculation is characterized in that described verification system comprises at least as lower module:
BPEL language editor module is used for developing the BPEL flow process that is verified;
The BPEL language is to the modular converter of Pi calculation, and the BPEL flow process that is used for being developed is converted to the Pi calculation;
Pi calculates editor module, is used for the Pi calculation after changing is rewritten;
Pi calculates authentication module, is used for the Pi calculation formula that generates is verified: each the Pi calculation formula after the conversion is used as a process, then all processes is advanced jointly, judged whether that by the communication between process the flow process deadlock takes place;
Deadlock reason display module is used for showing the text of explaining deadlock state;
Described BPEL language editor module, BPEL language are connected with deadlock reason display module successively to modular converter, Pi calculation editor module, the Pi calculation authentication module of Pi calculation, in Pi calculation authentication module, judge whether there is deadlock in the distributed flow process by the process communication of each module between mutually, and in deadlock reason display module by showing that the text of explaining deadlock state locatees deadlock position.
2. the distributed flow process verification system based on the Pi calculation as claimed in claim 1 is characterized in that described flow process deadlock has following feature:
A, in flow process advances, flow process can't be communicated by letter with other flow processs, but also has at least a flow process can not finally arrive abort state;
B, in flow process advances, though can also communication between the flow process, have flow process constantly to repeat to get back to a certain intermediateness more than one.
3. a method of utilizing the described distributed flow process verification system based on Pi calculation of claim 1 is characterized in that, comprises the steps:
Step 1, the flow process that BPEL language editor module will be disposed with the BPEL language description;
Step 2, the BPEL language, obtains several Pi and calculates flow process changing with the flow process of BPEL language description to the modular converter of Pi calculation;
Step 3, Pi calculation editor module is rewritten the Pi calculation flow process that obtains;
Step 4, Pi calculation authentication module adopts the stipulations theory of Pi calculation to carry out deadlock detection;
Described flow process deadlock has following feature: in flow process advanced, flow process can't be communicated by letter with other flow processs, but also has at least a flow process can not finally arrive abort state; Perhaps, in flow process advances, though all right communication between the flow process constantly repeats to get back to a certain intermediateness;
Step 5, deadlock reason display module is explained deadlock state with text, the location deadlock position.
4. method as claimed in claim 3 is characterized in that the transfer process of described step 2 specifically comprises the steps:
Step 201: read in whole BPEL file;
Step 202: the procedure name of process label correspondence in the BPEL file is calculated process name as a Pi;
Step 203: scan whole BPEL file, find out active tags arranged side by side and treatment mechanism label, each active tags name and treatment mechanism tag name are calculated process name, the concurrent defined content of process as process tag name correspondence of all these processes and a receiving process as a Pi;
Step 204: whether the active tags in the determining step 203 is structurized activity, if then the text between the Scan Architecture activity changes step 206 conversion over to, otherwise changes step 205 over to, up to the concurrent basic activity that all becomes of process;
Step 205: each basic activity is used as a Pi calculation process, and the Pi calculation that provides each basic activity is described;
Step 206: extract tag name arranged side by side between the structured activities, change step 203 over to, each active tags name and treatment mechanism tag name are calculated process name as a Pi.
5. method as claimed in claim 3, it is characterized in that, the Pi calculation editor module of described step 3 is rewritten the Pi calculation flow process that obtains, be meant process name and passage name in the Pi calculation formula that obtains to the modular converter of Pi calculation through the BPEL language are rewritten, promptly phrases such as the describing activity of using in the BPEL language, process, message are rewritten as the English alphabet of upper case or lower case, and adopt the form of note to note.
6. method as claimed in claim 3 is characterized in that, the Pi calculation authentication module of described step 4 adopts the stipulations theory of Pi calculation to carry out deadlock detection and specifically comprises the steps:
Step 401: each Pi calculation formula is regarded as an independent process;
Step 402: judge that these processes whether can reduction, if can, change step 404 over to; Otherwise change step 403 over to;
Step 403: judge whether all processes arrive abort state, if whether arrive abort state, then deadlock takes place, and notes current all states of a process, and state of a process before; Otherwise do not have deadlock fair termination takes place;
Step 404: if can stipulations, judge whether that the state that arrives more than a process is certain intermediateness that arrived in the past, if then deadlock takes place, and notes current all states of a process, and state of a process before; Otherwise change step 405 over to;
Step 405: the reduction rule by the Pi calculation carries out stipulations, and goes back to step 402, up to there being deadlock to take place or fair termination.
7. method as claimed in claim 3, it is characterized in that, the deadlock reason display module of described step 5 is to adopt text to make an explanation, and, that is to say that, passage name bright the process in the deadlock according to the rewriting note of step 3 changes the term in the BPEL language into the term description deadlock reason in natural language and the BPEL file.
8. method as claimed in claim 7 is characterized in that, described text is meant the file of suffix .txt by name.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010609285 CN102043681A (en) | 2010-12-28 | 2010-12-28 | Distribution type flow verification system and method based on Pi calculus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010609285 CN102043681A (en) | 2010-12-28 | 2010-12-28 | Distribution type flow verification system and method based on Pi calculus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102043681A true CN102043681A (en) | 2011-05-04 |
Family
ID=43909834
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010609285 Pending CN102043681A (en) | 2010-12-28 | 2010-12-28 | Distribution type flow verification system and method based on Pi calculus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102043681A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101339501A (en) * | 2008-08-12 | 2009-01-07 | 北京航空航天大学 | WS-BPEL control loop detection method based on directed graph |
| CN101588388A (en) * | 2009-05-26 | 2009-11-25 | 中国科学院软件研究所 | A kind of based on distributed adaptive service collaboration method and system thereof |
-
2010
- 2010-12-28 CN CN 201010609285 patent/CN102043681A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101339501A (en) * | 2008-08-12 | 2009-01-07 | 北京航空航天大学 | WS-BPEL control loop detection method based on directed graph |
| CN101588388A (en) * | 2009-05-26 | 2009-11-25 | 中国科学院软件研究所 | A kind of based on distributed adaptive service collaboration method and system thereof |
Non-Patent Citations (5)
| Title |
|---|
| 《中国优秀硕士学位论文全文数据库(信息科技辑)》 20060915 宋艳 基于pi-演算的BPEL4WS性质检验 正文第45-52页 5,7-8 , 第9期 * |
| 《中国优秀硕士学位论文全文数据库(信息科技辑)》 20060915 宋艳 基于pi-演算的BPEL4WS性质检验 正文第45-52页 5,7-8 , 第9期 2 * |
| 《中国优秀硕士学位论文全文数据库(信息科技辑)》 20080715 魏栋彦 基于Pi演算的服务流验证方法研究 正文第37页 1-5 , 第7期 * |
| 《中国优秀硕士学位论文全文数据库(信息科技辑)》 20090815 于鹏伟 基于pi-演算的WS_BPEL建模与实现 正文第17-52页 , 第8期 * |
| 《中国优秀硕士学位论文全文数据库(信息科技辑)》 20090815 于鹏伟 基于pi-演算的WS_BPEL建模与实现 正文第17-52页 , 第8期 2 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104375842B (en) | A kind of adaptable software UML modelings and its formalization verification method | |
| CN104216785B (en) | General policies task system and its implementation | |
| Obiso et al. | Management of Industry 4.0–reviewing intrinsic and extrinsic adoption drivers and barriers | |
| CN109656914A (en) | On-line off-line mixed air control modeling training and production dissemination method and system | |
| CN110445939A (en) | The prediction technique and device of capacity resource | |
| CN103186830A (en) | Work order generation method and device according to mail intelligent analysis | |
| CN110119417A (en) | A kind of substation's remote action data intelligence check analysis system and check analysis method | |
| CN102013055A (en) | Method and system for verifying service orchestration process | |
| CN109543114A (en) | Heterogeneous Information network linking prediction technique, readable storage medium storing program for executing and terminal | |
| Zamansky et al. | Formal methods in collaborative projects | |
| Chemaa et al. | A high-level Petri net based model for web services composition and verification | |
| CN102043681A (en) | Distribution type flow verification system and method based on Pi calculus | |
| CN115146064A (en) | Intention recognition model optimization method, device, equipment and storage medium | |
| Heavey et al. | Process modelling support for the conceptual modelling phase of a simulation project | |
| Zafar et al. | Business process models to Web services generation: A systematic literature review | |
| CN107102543A (en) | The forming method and device of a kind of energy router anti-interference controller | |
| CN113486646A (en) | Product report issuing method and device, electronic equipment and readable storage medium | |
| Wang et al. | A Reliability-oriented Evolution Method of Software Architecture Based on Contribution Degree of Component. | |
| Li | Application Analysis of RFID in Library Automation Management | |
| CN109754159A (en) | A kind of information extracting method and system of operation of power networks log | |
| AbuSalim et al. | Analyzing the Impact of Assessing Requirements Specifications on the Software Development Life Cycle | |
| Mohammadi et al. | Scheduling new product development projects using simulation-based dependency structure matrix | |
| Cugini et al. | Total quality management and process modeling for PLM in SME | |
| Wang et al. | An Approach to transforming UML model to FSM model for automatic testing | |
| Cai et al. | Test sequence generation and optimization method based on Cooperative Vehicle Infrastructure System simulation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110504 |