CN102109984A - Method and system for processing state machine - Google Patents
Method and system for processing state machine Download PDFInfo
- Publication number
- CN102109984A CN102109984A CN2009102440823A CN200910244082A CN102109984A CN 102109984 A CN102109984 A CN 102109984A CN 2009102440823 A CN2009102440823 A CN 2009102440823A CN 200910244082 A CN200910244082 A CN 200910244082A CN 102109984 A CN102109984 A CN 102109984A
- Authority
- CN
- China
- Prior art keywords
- data
- condition
- satisfy
- state machine
- output test
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000012545 processing Methods 0.000 title claims abstract description 33
- 238000006243 chemical reaction Methods 0.000 claims abstract description 27
- 238000007689 inspection Methods 0.000 claims description 37
- 238000012360 testing method Methods 0.000 claims description 37
- 230000002159 abnormal effect Effects 0.000 claims description 4
- 238000004321 preservation Methods 0.000 claims 2
- 238000002955 isolation Methods 0.000 abstract description 4
- 238000003672 processing method Methods 0.000 abstract 1
- 230000008569 process Effects 0.000 description 27
- 238000012795 verification Methods 0.000 description 21
- 230000007704 transition Effects 0.000 description 18
- 230000006870 function Effects 0.000 description 17
- 230000009471 action Effects 0.000 description 13
- 238000004364 calculation method Methods 0.000 description 7
- 238000007726 management method Methods 0.000 description 7
- 239000000463 material Substances 0.000 description 7
- 230000004044 response Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000003139 buffering effect Effects 0.000 description 4
- 239000003795 chemical substances by application Substances 0.000 description 4
- 230000005856 abnormality Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 3
- 230000005012 migration Effects 0.000 description 3
- 238000013508 migration Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000012856 packing Methods 0.000 description 3
- 238000012550 audit Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000013439 planning Methods 0.000 description 2
- 238000007639 printing Methods 0.000 description 2
- 230000004083 survival effect Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 239000007767 bonding agent Substances 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 238000000547 structure data Methods 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a method and a system for processing a state machine. The processing method comprises the following steps of: judging whether the input data meet the input checkout conditions; if so, adding conversion tags for the input data, wherein the input checkout conditions correspond to the conversion tags; performing state conversion indicated by the conversion tags on the input data; adding state update tags for the converted data; judging whether the state update tags meet the output checkout conditions; and if so, performing output processing on the converted data according to the processing rules corresponding to the output checkout conditions. According to the method and the system, the input data are checked through the predetermined rules, the screened data in accordance with the conditions are converted, and the converted data are output according to the predetermined rules, so that isolation of input/output and state conversion of the data is realized.
Description
Technical field
The present invention relates to the informationization technology field, in particular to a kind of disposal route and system of state machine.
Background technology
State machine generally refers to finite state machine, and the finite state machine system is meant the system that can present different running statuses in different phase, and these states are limited, nonoverlapping.Such system at a time is bound to be in a state in its all states, and this moment, it received the input that a part allows, and produces the possible response of a part, and moves to the possible state of a part.Be that finite state machine comprises five key elements: state, incident, condition, action, migration.
A definite description of extreme about state machine is that it is a directed graph, is made up of a group node and one group of corresponding transfer function.State machine is " RUN " by a series of incidents of response.All in the range of control of the transfer function that belongs to " current " node, wherein the scope of function is a subclass of node to each incident.Function returns " next one " (perhaps being same) node.Have at least one must be final state in these nodes.When arriving final state, state machine stops.
For example, can think that computer program is exactly a kind of finite state machine.In the time of program run, response user operation is arrived the another one state with the state transition of data.State machine is a kind of disposal route commonly used on the software.It resolves into limited steady state (SS) to complicated steering logic, decision event on each state, and change is treated to discrete digital continuously and handles, and meets the work characteristics of computing machine.
Present state machine is mainly paid close attention to the processing of state machine inside, the IO interface that is used for the state machine migration then is to realize by the data consistency standard in the closed system, the necessary strict coupling of all in other words state machines and environment, but like this, concerning its extended use of isolation of state machine, then not very remarkable.
Problem at state transition process and data input and output being isolated in the correlation technique does not propose effective solution at present as yet.
Summary of the invention
At the problem that state transition process and data input and output can't be isolated in the correlation technique and propose the present invention, for this reason, fundamental purpose of the present invention is to provide a kind of disposal route and system of state machine, one of to address the above problem at least.
To achieve these goals, according to an aspect of the present invention, provide a kind of disposal route of state machine, it comprises: whether the data of judging input satisfy the incoming inspection condition; If satisfy, then be the data additional conversion label of input, wherein, incoming inspection condition and switch labels have corresponding relation; The data of input are carried out state exchange by switch labels indication; Data additivity after the conversion is upgraded label; Judge that state upgrades label and whether satisfies the output test condition; If satisfy, the data after changing are exported processing according to the processing rule of output test condition correspondence.
To achieve these goals, according to a further aspect in the invention, a kind of disposal system of state machine is provided, it comprises: load module, be used to judge whether the data of input satisfy the incoming inspection condition, and under situation about satisfying, be the data additional conversion label of input, wherein, incoming inspection condition and switch labels have corresponding relation; The state exchange module is used for the data of input are carried out state exchange by switch labels indication, and after conversion to the renewal of the data additivity after conversion label; Output module is used for judging whether state renewal label satisfies the output test condition, and according to the processing rule of output test condition correspondence the data after changing is being exported processing under the situation about satisfying.
According to the present invention, by predetermined rule the data of input are tested, filter out qualified data and change, and according to predetermined rule output, thereby realized the input and output of data and the isolation of state transition process.Further, parametric form by simplification and unified IO interface, can also support to satisfy the input and output requirement of multiple otherness, and the multinest of status of support machine and partial update, thereby make it possible to be applied to easily the application scenario under the network environment, particularly use towards the network calculations of many agencies, mobile agent.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is the process flow diagram according to the disposal route of the state machine of the embodiment of the invention;
Fig. 2 is the synoptic diagram according to the state machine function module of the embodiment of the invention;
Fig. 3 is the synoptic diagram according to the state machine treatment state of the embodiment of the invention;
Fig. 4 is the structured flowchart according to the disposal system of the state machine of the embodiment of the invention.
Embodiment
Hereinafter will describe the present invention with reference to the accompanying drawings and in conjunction with the embodiments in detail.Need to prove that under the situation of not conflicting, embodiment and the feature among the embodiment among the application can make up mutually.
Method embodiment
According to embodiments of the invention, provide a kind of disposal route of state machine.
As shown in Figure 1, this method comprises following step:
S102 judges whether the data of input satisfy the incoming inspection condition.
In the present embodiment, concrete, judge whether the data of importing satisfy the incoming inspection condition on the node, wherein, in advance with tree structure configuration incoming inspection condition, the corresponding switch labels of the incoming inspection condition on each node; If satisfy, then preserve with this node on the corresponding switch labels of incoming inspection condition.If satisfy predetermined condition between the judged result of the incoming inspection condition on all nodes, then judge the data of being imported and satisfy the incoming inspection condition.
Further, in this example, can judge whether satisfy predetermined condition between the judged result of the incoming inspection condition on all nodes by following steps:
1) judges between the judged result of the incoming inspection condition on all child nodes belong to same father node whether satisfy predetermined condition step by step.
In the present embodiment, concrete, the judged result on all child nodes is carried out logical operation; Whether the result that the decision logic computing obtains satisfies predetermined condition.If satisfy, then belong between the judged result of the incoming inspection condition on all child nodes of same father node and satisfy predetermined condition.
2) if father nodes at different levels all satisfy, then the judged result of the incoming inspection condition on all nodes satisfies predetermined condition.
S104 if satisfy, then is the data additional conversion label of input, and wherein, incoming inspection condition and switch labels have corresponding relation.
In the present embodiment, concrete, if satisfy predetermined condition between the judged result of the incoming inspection condition on all nodes, then judge the data of being imported and satisfy the incoming inspection condition, be the additional switch labels of preserving of the data of input.
S106 carries out state exchange by switch labels indication to the data of input.
In the present embodiment, concrete, respectively the data of input are carried out state exchange by each switch labels indication according to the order of each switch labels.
S108 upgrades label to the data additivity after the conversion.
S110 judges that state upgrades label and whether satisfies the output test condition.
Concrete, judge whether state renewal label satisfies the output test condition on the node, wherein, in advance with tree structure configuration output test condition, the corresponding a kind of processing rule of the output test condition on each node; If satisfy, then preserve with this node on the corresponding processing rule of output test condition.If satisfy predetermined condition between the judged result of the output test condition on all nodes, then the judgement state upgrades the satisfied output of label test condition.
In the present embodiment, can judge whether satisfy predetermined condition between the judged result of the output test condition on all nodes by following steps:
1) judges between the judged result of the output test condition on all child nodes belong to same father node whether satisfy predetermined condition step by step.
Concrete, the judged result on all child nodes is carried out logical operation; Whether the result that the decision logic computing obtains satisfies predetermined condition.If satisfy, then belong between the judged result of the output test condition on all child nodes of same father node and satisfy predetermined condition.
2) if father nodes at different levels all satisfy, then satisfy predetermined condition between the judged result of the output test condition on all nodes.
S112 if satisfy, exports processing according to the processing rule of output test condition correspondence to the data after changing.
Concrete, according to the processing rule of preserving the data after changing are exported processing.
In the present embodiment, the third party who is positioned at the state machine outside obtains the result of state machine by message interface.Here, result comprise following one of at least: the abnormal results of the abnormal results of state machine output, state machine output when state upgrades label and do not satisfy the output test condition when the data of input do not satisfy the incoming inspection condition.
The invention will be further described below in conjunction with specification drawings and specific embodiments.
In conjunction with the enforcement of the publishing system of network-oriented, this system mainly finishes the collection of publishing relevant information and realizes the system that the space of a whole page generates automatically by the database publishing mode; Wherein publish relevant information spinner and will comprise two aspects: promptly publish the Publishing Data that the space of a whole page represents and the data (mainly comprising advertising fee payout status etc.) of related management.Wherein database publishing is meant the space of a whole page pattern of publishing by definition, and after the mapping relations between space of a whole page element and the Database field, system can generate a kind of publishing way of space of a whole page unit in batches.
Fig. 2 is the synoptic diagram according to the state machine function module of the embodiment of the invention.As shown in Figure 2, state machine 11 according to the embodiment of the invention comprises: load module 12, state exchange module 13, output module 14, message management module 15, wherein load module 12 comprises corresponding input interface 16, output module 14 comprises corresponding output interface 17, and message response module 15 comprises corresponding operation information interface 18.
Activate a state machine action, be that the Message Processing formation that relies on state machine to accept realizes that the message response module of state machine 11 comprises a message queue and message trigger device, message queue is mainly used in the message that buffer memory receives, and the message response module can be handled one by one; The message trigger device makes the message response module can mate and call the built-in function processing function of state machine according to information.
At first, message trigger 21 triggers state machine 11, accepts data after state machine indication load module 12 Reset Status.There is the data buffering pond in load module 12, and external data can not tested and directly be entered in this Buffer Pool etc. pendingly, and the data that leave in the data buffering pond have effective survival period of setting, and it is then deleted to exceed this survival period.In the practice system, load module 12 and the shared data designated Buffer Pool of other common grounds.
According to the data input channel configuration file of the embodiment of the invention can for:
<？xml?version＝″1.0″encoding＝″utf-8″？>
<root>
<info>
<version>1.00</version>
<updatatime>2009-10-19?18:23:22</updatatime>
</info>
<data>
＜item name=" qualified buffer memory " check=" " action=" refreshstatic31 " 〉
＜item name=" audit of paying the fees " check=" checkfee (@ID) "
action＝″″>
＜item name=" advertisement submission " check=" checkplan (@ID) "
action＝″printblock32″entry＝″true″>
＜item name=" advertisement agency's submission "
check＝″checkproxy(@ID)″action＝″package33″/>
</item>
</item>
＜item name=" task coupling " rel=" and " 〉
＜item name=" picture submission " check=" checktask (@ID) "
action＝″refreshstatic31″/>
＜item name=" planning is submitted to " check=" checktask (@ID) "
action＝″refreshstatic31″/>
</item>
</item>
</data>
</root>
Then, because ID is 23221 data block is the ad material that advertising agent is made, then pass through " checkproxy (@ID) " function verification succeeds of " advertisement agency's submission " node, wherein, checkproxy (@ID) formula expression of supporting for state machine in the present embodiment, be that checkproxy is the ID that call function ， @ID that state machine is supported refers to the application call data, wherein the @ symbolic representation should be the ID of input object as function input parameter ID;
" if advertisement agency's submission " node " checkproxy (@ID) " the function verification succeeds, the check that then finds father node " advertisement submission " node of " advertisement agency's submission " node proceeds verification, as above shown, carry out the relevant verification of advertisement plan, the adline of permission in promptly publishing in the original plan, the advertisement layout size, the verification checkplan (@ID of ad material requirement etc.), if above-mentioned verification is success still, the check that then finds father node " audit of the paying the fees " node of " advertisement submission " node proceeds verification, carries out the function verification checkfee@ID that advertising expenditure is paid).
As all successes of above-mentioned verification, then carry out the verification of " qualified buffer memory " at last, this node is not provided with verification in the present embodiment, and then ID is that 23221 data block is copied to state machine inside.There is failure as above-mentioned verification, or do not find entry node, then load module then feeds back corresponding abnormality code to the message management module, and external program obtains abnormality code from the message management module, perhaps sends abnormality code to the designated program address by the message management module.
Here need to prove, 12 pairs of data of above-mentioned load module copy to state machine inside with related data, rather than simply quote after checking successfully, state machine data is followed following principle, guarantee the integrality and the correctness of legacy data, promptly before obtaining the process object modification, behind the copy data object copy data object is made amendment, after data modification is finished, replace the legacy data object by output module output, after promptly data handling procedure is cancelled, do not influence the legacy data object.For the data object of not supporting many concurrent processing, limit the state of " being operated lock " flag data of locking time by record in data object.
Data object writes down the action sequence of the xml node of verification passage by after the verification of load module 12.In the foregoing description, " advertisement agency's submission " node record " package33 " function also is a formula expression, and " the packing material sends " 33 state transition process in the state machine are called in expression; " advertisement submission " node record " printblock32 " function, expression call " backstage generates sample and sends " 32 state transition process in the state machine; " qualified buffer memory " node record " refreshstatic31 " function, " renewal of space of a whole page statistic " 31 state transition process in the state machine are called in expression.
Above-mentioned three state transition process, be three parallel state transition process of definition in the state machine 11, as shown in Figure 3, wherein " renewal of space of a whole page statistic " 31 state exchanges are that the record that advertisement is published is updated in the space of a whole page status data so that the disbursement and sattlement in the supervision of space of a whole page state and later stage etc.; " backstage generates sample and sends " 32 state transition process are used to utilize template to generate EPS or the PDF sample of advertising message at the corresponding space of a whole page, and the later stage does not need to revise to be directly used in pieces together big version; " packing material send " 33 state transition process are with the follow-up advertisement related materials revised of may needing, and after setting type through template, output to assigned address together with packings such as materials.
Above-mentioned each state transition process process all triggers the corresponding message of message manager, and external program can pass through message interface, knows the state of data objects processing and processed flow process, and take place in the processing procedure various unusual.
According to the data output channel configuration file of the embodiment of the invention can for:
<？xml?version＝″1.0″encoding＝″utf-8″？>
<root>
<info>
<version>1.00</version>
<updatatime>2009-10-19?18:23:22</updatatime>
</info>
<data>
＜item name=" data output " 〉
＜item name=" output of collection version " valve=" " 〉
＜item name=" adjustment of the printing plate numbering " valve=" refreshstatic "
aim＝″http://198.23.11.121/webservice/caiwu.asmx？obj＝@ID″/>
＜item name=" format template " valve=" printbloc k "
aim＝″doprintblock()″/>″
</item>
＜item name=" clean copy output " valve=" package "
aim＝″save(@ID)″/>
</item>
</data>
</root>
According to above-mentioned configuration file, output module 14 is sought all child nodes successively from the data node, as finding to exist the node of valve attributes match, then carries out the action that defines in the aim attribute.
For example, after process " renewal of space of a whole page statistic " 31 state transition process, data object obtains " renewal of space of a whole page statistic " corresponding mark " refreshstatic ", behind qualified when searching out " adjustment of the printing plate numbering " node, then carry out the content of aim attribute definition, http: // 198.23.11.121/webservice/caiwu.asmx? obj=@ID, wherein the aim nodal value also is a formula expression, wherein expression name is called the ID of the parameter of ID from data object.The processing of other nodes also is the same.
The output verification of above-mentioned output module after the data object process output verification, in fact can be provided with many outgoing route as can be seen, is the multiple goal output data.
In the data buffering pond that data output after output module will be handled is generally speaking formulated.
In the foregoing description, state machine 11 is stateless state machine, it is the device that itself does not comprise data storage, and also have the state machine of state in the practice, be the device that itself comprises data storage, promptly data can be preserved in the data storage device of state machine itself through after the input media, whether these data carry out state transition process, trigger by message management apparatus.
Here, at output terminal, disposing output search condition (for example, printblock, package etc.) with tree structure is a kind of preferred mode, and for example, each output search condition can also be a coordination.
According to the embodiment of the invention, can realize generating complicated state machine application system, this system is adapted at using under the distributed network environment of applications.Based on the interface method for normalizing of template, not only solve the version problem of state machine simultaneously, it is very simple that state machine is called.
Effect of the present invention is: by interface simplification, the standardization with input and output, under the design of " data-driven (Data Driver) ", come out state machine is relatively independent, and interface normalization with input and output, any state machine node can simply be inserted on the digraph of state machine, can not influence the operation of whole state machine.Specifically, the embodiment of the invention has following effects:
1) state machine of setting up by method of the present invention can be realized dynamic adjustment, real-time dynamic test, partial update, and can not have influence on the stability of total system.
2) the present invention can dispose state machine easily, and can support the data mode conversion process of multilayer nest by input and output and the structurized configuration template of xml based on the xml structural data under network environment.
3) adopt single face method of the present invention, can realize the treatment scheme of state machine inside, can be easily with other state machine carry out nested, thereby can handle the needs of a large amount of recurrence, layering, application scenario such as distributed.
Why the present invention has above-mentioned remarkable result, its reason is: what the present invention is based on foundation utilizes xml tree structure data characteristic, set up data mode migration " pipeline ", and node verification " valve " control data of the interface by input and output is oriented flowing in state machine, and set up association between the inter-process link by " label ".Above-mentioned innovation setting has realized based on data template, data-centered, message being a kind of new state machine system of bonding agent.
Device embodiment
According to embodiments of the invention, provide a kind of disposal system of state machine.
Fig. 4 is the structured flowchart according to the disposal system of the state machine of the embodiment of the invention.As shown in Figure 4, this disposal system comprises: load module 402 is used to judge whether the data of input satisfy the incoming inspection condition, and is the data additional conversion label of input that under situation about satisfying wherein, incoming inspection condition and switch labels have corresponding relation; State exchange module 404 is used for the data of input are carried out state exchange by switch labels indication, and after conversion to the renewal of the data additivity after conversion label; Output module 406 is used for judging whether state renewal label satisfies the output test condition, and according to the processing rule of output test condition correspondence the data after changing is being exported processing under the situation about satisfying.
Said system can also comprise: message management module 408 is used for by message interface the result of state machine being sent to the third party who is positioned at the state machine outside.
The disposal system of the state machine in the present embodiment can adopt the disposal route among the said method embodiment to come state machine is handled, so repeat no more in this workflow to the disposal system of state machine.
According to the present invention, by predetermined rule the data of input are tested, filter out qualified data and change, and according to predetermined rule output, thereby realized the input and output of data and the isolation of state transition process.Further, parametric form by simplification and unified IO interface, can also support to satisfy the input and output requirement of multiple otherness, and the multinest of status of support machine and partial update, thereby make it possible to be applied to easily the application scenario under the network environment, particularly use towards the network calculations of many agencies, mobile agent.
Need to prove, can in computer system, carry out in the step shown in the process flow diagram of accompanying drawing such as a set of computer-executable instructions, and, though there is shown logical order in flow process, but in some cases, can carry out step shown or that describe with the order that is different from herein.
Obviously, those skilled in the art should be understood that, above-mentioned each module of the present invention or each step can realize with the general calculation device, they can concentrate on the single calculation element, perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in the memory storage and carry out by calculation element, perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (13)
1. the disposal route of a state machine is characterized in that, comprising:
Whether the data of judging described input satisfy the incoming inspection condition;
If satisfy, then be the data additional conversion label of described input, wherein, described incoming inspection condition and described switch labels have corresponding relation;
The data of described input are carried out state exchange by the indication of described switch labels;
Data additivity after the conversion is upgraded label;
Judge that described state upgrades label and whether satisfies the output test condition;
If satisfy, export processing according to the processing rule of the described output test condition correspondence data after to described conversion.
2. method according to claim 1 is characterized in that,
Whether the data of judging described input satisfy the incoming inspection condition specifically comprises:
Judge whether the data of importing satisfy the incoming inspection condition on the node, wherein, in advance with tree structure configuration incoming inspection condition, the corresponding switch labels of the incoming inspection condition on each node;
If satisfy, then preserve with this node on the corresponding switch labels of incoming inspection condition;
If satisfy predetermined condition between the judged result of the incoming inspection condition on all nodes, judge that then the data of described input satisfy the incoming inspection condition; For the data additional conversion label of described input specifically comprises:
Add the switch labels of described preservation for the data of described input.
3. method according to claim 2 is characterized in that, the data of described input are carried out specifically being comprised by the state exchange of described switch labels indication:
Respectively the data of described input are carried out state exchange by each switch labels indication according to the order of each switch labels.
4. method according to claim 1 is characterized in that, judges whether described state renewal label satisfies the output test condition and specifically comprise:
Judge whether described state renewal label satisfies the output test condition on the node, wherein, in advance with tree structure configuration output test condition, the corresponding a kind of processing rule of the output test condition on each node;
If satisfy, then preserve with this node on the corresponding processing rule of output test condition;
If satisfy predetermined condition between the judged result of the output test condition on all nodes, judge that then described state upgrades label and satisfies the output test condition.
5. method according to claim 4 is characterized in that, exports processing according to the processing rule of the described output test condition correspondence data after to described conversion and specifically comprises:
Export processing according to the processing rule of the described preservation data after to described conversion.
6. method according to claim 2 is characterized in that, judges whether satisfy predetermined condition between the judged result of the incoming inspection condition on all nodes by following steps:
Judge step by step between the judged result of the incoming inspection condition on all child nodes belong to same father node and whether satisfy predetermined condition;
If father nodes at different levels all satisfy, then the judged result of the incoming inspection condition on all nodes satisfies predetermined condition.
7. method according to claim 6 is characterized in that, judges by following steps whether the judged result of the incoming inspection condition on all child nodes that belong to same father node satisfies predetermined condition:
Judged result on described all child nodes is carried out logical operation;
Whether the result that the decision logic computing obtains satisfies described predetermined condition.
8. method according to claim 4 is characterized in that, judges whether satisfy predetermined condition between the judged result of the output test condition on all nodes by following steps:
Judge step by step between the judged result of the output test condition on all child nodes belong to same father node and whether satisfy predetermined condition;
If father nodes at different levels all satisfy, then satisfy predetermined condition between the judged result of the output test condition on all nodes.
9. method according to claim 8 is characterized in that, judges by following steps whether the judged result of the output test condition on all child nodes that belong to same father node satisfies predetermined condition:
Judged result on described all child nodes is carried out logical operation;
Whether the result that the decision logic computing obtains satisfies described predetermined condition.
10. method according to claim 1 is characterized in that, the third party who is positioned at described state machine outside obtains the result of described state machine by message interface.
11. method according to claim 10, it is characterized in that, described result comprise following one of at least: the abnormal results of the abnormal results of state machine output, state machine output when described state upgrades label and do not satisfy the output test condition when the data of described input do not satisfy the incoming inspection condition.
12. the disposal system of a state machine is characterized in that, comprising:
Load module is used to judge whether the data of described input satisfy the incoming inspection condition, and is the data additional conversion label of described input under situation about satisfying, and wherein, described incoming inspection condition and described switch labels have corresponding relation;
The state exchange module is used for the data of described input are carried out state exchange by the indication of described switch labels, and after conversion to the renewal of the data additivity after conversion label;
Output module is used to judge that described state upgrades label and whether satisfies the output test condition, and is exporting processing according to the processing rule of the described output test condition correspondence data after to described conversion under the situation about satisfying.
13. system according to claim 12 is characterized in that, described system further comprises:
The message management module is used for by message interface the result of described state machine being sent to the third party who is positioned at described state machine outside.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910244082.3A CN102109984B (en) | 2009-12-28 | 2009-12-28 | Method and system for processing state machine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910244082.3A CN102109984B (en) | 2009-12-28 | 2009-12-28 | Method and system for processing state machine |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102109984A true CN102109984A (en) | 2011-06-29 |
| CN102109984B CN102109984B (en) | 2014-02-19 |
Family
ID=44174160
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910244082.3A Expired - Fee Related CN102109984B (en) | 2009-12-28 | 2009-12-28 | Method and system for processing state machine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102109984B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103176896A (en) * | 2011-12-23 | 2013-06-26 | 阿里巴巴集团控股有限公司 | Generating method and generating device of test cases |
| CN103269290A (en) * | 2013-04-18 | 2013-08-28 | 中国移动通信集团陕西有限公司 | Method and device for intelligently analyzing abnormity of network based on case library |
| CN104933118A (en) * | 2015-06-05 | 2015-09-23 | 东南大学 | Process definition meta model in theme-based issuing/subscription system and building method of process definition meta model |
| CN105426236A (en) * | 2015-11-11 | 2016-03-23 | 上海斐讯数据通信技术有限公司 | Realization method and device of high-concurrence state machine as well as system |
| CN107943482A (en) * | 2017-11-02 | 2018-04-20 | 千寻位置网络有限公司 | Rule-based stream data processing method unification monitor supervision platform |
| CN109542664A (en) * | 2018-12-13 | 2019-03-29 | 平安科技（深圳）有限公司 | File verification method, apparatus and computer equipment based on artificial intelligence |
| CN109976835A (en) * | 2017-12-27 | 2019-07-05 | 北京京东尚科信息技术有限公司 | A kind of method and system managing Obj State |
| CN115048160A (en) * | 2022-06-21 | 2022-09-13 | 中国人民解放军32039部队 | Data processing method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5905902A (en) * | 1995-09-28 | 1999-05-18 | Intel Corporation | Programmable state machine employing a cache-like arrangement |
| CN1564489A (en) * | 2004-04-19 | 2005-01-12 | 中兴通讯股份有限公司 | Testing method for limitting status machine of communication system |
| US7464301B1 (en) * | 2005-08-04 | 2008-12-09 | Unisys Corporation | Method and apparatus for capturing and logging activities of a state machine prior to error |
-
2009
- 2009-12-28 CN CN200910244082.3A patent/CN102109984B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5905902A (en) * | 1995-09-28 | 1999-05-18 | Intel Corporation | Programmable state machine employing a cache-like arrangement |
| CN1564489A (en) * | 2004-04-19 | 2005-01-12 | 中兴通讯股份有限公司 | Testing method for limitting status machine of communication system |
| US7464301B1 (en) * | 2005-08-04 | 2008-12-09 | Unisys Corporation | Method and apparatus for capturing and logging activities of a state machine prior to error |
Non-Patent Citations (2)
| Title |
|---|
| 刘勇等: "面向内容的有限状态网络服务模型", 《电子学报》 * |
| 闫新庆等: "无线射频识别系统中的事件处理机制", 《华中科技大学学报（自然科学版）》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103176896A (en) * | 2011-12-23 | 2013-06-26 | 阿里巴巴集团控股有限公司 | Generating method and generating device of test cases |
| CN103176896B (en) * | 2011-12-23 | 2015-08-26 | 阿里巴巴集团控股有限公司 | A kind of generation method of test case and device |
| CN103269290A (en) * | 2013-04-18 | 2013-08-28 | 中国移动通信集团陕西有限公司 | Method and device for intelligently analyzing abnormity of network based on case library |
| CN103269290B (en) * | 2013-04-18 | 2016-04-13 | 中国移动通信集团陕西有限公司 | The method and apparatus of Design case based storehouse intellectual analysis Network Abnormal |
| CN104933118A (en) * | 2015-06-05 | 2015-09-23 | 东南大学 | Process definition meta model in theme-based issuing/subscription system and building method of process definition meta model |
| CN105426236A (en) * | 2015-11-11 | 2016-03-23 | 上海斐讯数据通信技术有限公司 | Realization method and device of high-concurrence state machine as well as system |
| CN107943482A (en) * | 2017-11-02 | 2018-04-20 | 千寻位置网络有限公司 | Rule-based stream data processing method unification monitor supervision platform |
| CN109976835A (en) * | 2017-12-27 | 2019-07-05 | 北京京东尚科信息技术有限公司 | A kind of method and system managing Obj State |
| CN109542664A (en) * | 2018-12-13 | 2019-03-29 | 平安科技（深圳）有限公司 | File verification method, apparatus and computer equipment based on artificial intelligence |
| CN109542664B (en) * | 2018-12-13 | 2024-07-16 | 平安科技（深圳）有限公司 | File verification method and device based on artificial intelligence and computer equipment |
| CN115048160A (en) * | 2022-06-21 | 2022-09-13 | 中国人民解放军32039部队 | Data processing method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102109984B (en) | 2014-02-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102109984B (en) | Method and system for processing state machine | |
| US8196126B2 (en) | Methods and systems for dynamically generating and optimizing code for business rules | |
| CN102542382B (en) | The method of operating of business rule and device | |
| US20090234791A1 (en) | Systems and Methods for Automated Interpretation of Analytic Procedures | |
| CN111176867B (en) | Data sharing exchange and open application platform | |
| CN107103064B (en) | Data statistical method and device | |
| CN109903012A (en) | A kind of equipment quality progress monitoring system and control method | |
| US9299049B2 (en) | Contract-based process integration | |
| CN116719799A (en) | Environment-friendly data management method, device, computer equipment and storage medium | |
| Attajer et al. | Benchmarking simulation software capabilities against distributed control requirements: FlexSim vs AnyLogic | |
| Zhang et al. | Representation of Petri net with OWL DL ontology | |
| US11282033B2 (en) | Inter-company information sharing system and inter-company information sharing method | |
| Emmenegger et al. | Towards a procedure for assessing supply chain risks using semantic technologies | |
| Falkenthal et al. | Requirements and enforcement points for policies in industrial data sharing scenarios | |
| CN111177126B (en) | Information processing method, device and equipment | |
| Cantenot et al. | Test generation with Satisfiability Modulo Theories solvers in model‐based testing | |
| Odeh et al. | A new classification of non-functional requirements for service-oriented software enineering | |
| CN112183991A (en) | Power plant data management method and system, electronic equipment and storage medium | |
| König et al. | A measure for resilience of critical infrastructures | |
| Spies | A software assurance evidence approach to cloud security | |
| Buzdugan et al. | Architecture Considerations for a Decision Support System in Cyber Risk Management | |
| Vekris et al. | Efficient Operational Semantics for for Verification of Temporal Properties | |
| Hruska et al. | A Functional All‐Hazard Approach to Critical Infrastructure Dependency Analysis | |
| Dong | Service-Oriented Logistics Management System based on Internet of Things | |
| Kholkar et al. | Applying MDA to rule and data generation for compliance checking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140219 Termination date: 20141228 |
|
| EXPY | Termination of patent right or utility model |