CN102109984B - Method and system for processing state machine - Google Patents
Method and system for processing state machine Download PDFInfo
- Publication number
- CN102109984B CN102109984B CN200910244082.3A CN200910244082A CN102109984B CN 102109984 B CN102109984 B CN 102109984B CN 200910244082 A CN200910244082 A CN 200910244082A CN 102109984 B CN102109984 B CN 102109984B
- Authority
- CN
- China
- Prior art keywords
- data
- condition
- meet
- state
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000012545 processing Methods 0.000 title claims abstract description 36
- 238000006243 chemical reaction Methods 0.000 claims abstract description 30
- 238000007689 inspection Methods 0.000 claims description 37
- 238000012360 testing method Methods 0.000 claims description 37
- 230000008569 process Effects 0.000 claims description 28
- 230000002159 abnormal effect Effects 0.000 claims description 5
- 238000002955 isolation Methods 0.000 abstract description 4
- 238000003672 processing method Methods 0.000 abstract 1
- 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
- 230000004048 modification Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 239000003795 chemical substances by application Substances 0.000 description 4
- 230000005856 abnormality 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
- 238000012856 packing Methods 0.000 description 3
- 238000012550 audit Methods 0.000 description 2
- 230000008859 change Effects 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
- 239000007767 bonding agent Substances 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000013011 mating Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000010606 normalization 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 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 finite state machine system refers to the system that can present different running statuses in different phase, and these states are limited, nonoverlapping.Such system state in its all states that is at a time bound to, now its receives the input that a part allows, and produces the response that a part is possible, and moves to the state that a part is possible.Be that finite state machine comprises five key elements: state, event, condition, action, migration.
A definite description of extreme about state machine is that it is a directed graph, a group node and one group of corresponding transfer function, consists of.State machine is " RUN " by response sequence of events.Each event is in the range of control of transfer function that belongs to " current " node, and wherein the scope of function is a subset of node.Function returns to " next one " (being perhaps same) node.In these nodes, have at least one must be final state.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 operation, response user operation, arrives another one state by the state transition of data.State machine is a kind of disposal route conventional on software.It resolves into limited steady state (SS) complicated steering logic, and decision event on each state becomes and is treated to continuously discrete digital processing, meets the work characteristics of computing machine.
Current state machine is mainly paid close attention to the processing of state machine inside, for being to realize by the data consistency standard in closed system by the IO interface of state machine migration, in other words all state machines and environment must strict mating, but like this, concerning its extended use of the isolation of state machine, not very remarkable.
Problem for state transition process and data input and output being isolated in correlation technique, not yet proposes effective solution at present.
Summary of the invention
For the problem that state transition process and data input and output cannot be isolated in 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 judgement input meet incoming inspection condition; If meet, be the data additional conversion label of input, wherein, incoming inspection condition and switch labels have corresponding relation; The state that the data of input are carried out being indicated by switch labels is changed; Data additivity after conversion is upgraded to label; Judge that state upgrades label and whether meets output test condition; If meet, according to the processing rule that output test condition is corresponding, data after changing are exported to processing.
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, for judging whether the data of input meet incoming inspection condition, and be the data additional conversion label of input satisfied in the situation that, wherein, incoming inspection condition and switch labels have corresponding relation; State modular converter, changes for the state that the data of input are carried out being indicated by switch labels, and after conversion, the data additivity after conversion is upgraded to label; Output module for judging that state upgrades label and whether meets output test condition, and is exported processing according to processing rule corresponding to output test condition to the data after changing satisfied in the situation that.
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, by simplifying and unify the parametric form of IO interface, can also support to meet the input and output requirement of multiple otherness, and the multinest of status of support machine and part renewal, thereby make it possible to be applied to easily the application scenario of net environment, particularly towards the network calculations of many agencies, mobile agent, apply.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms the application's a part, and schematic description and description of the present invention is used for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is according to the process flow diagram of the disposal route of the state machine of the embodiment of the present invention;
Fig. 2 is according to the schematic diagram of the state machine function module of the embodiment of the present invention;
Fig. 3 is according to the schematic diagram of the state machine treatment state of the embodiment of the present invention;
Fig. 4 is according to the structured flowchart of the disposal system of the state machine of the embodiment of the present invention.
Embodiment
Hereinafter with reference to accompanying drawing, also describe the present invention in detail in conjunction with the embodiments.It should be noted that, in the situation that not conflicting, embodiment and the feature in embodiment in the application can combine mutually.
Embodiment of the method
According to embodiments of the invention, provide a kind of disposal route of state machine.
As shown in Figure 1, the method comprises following step:
S102, whether the data of judgement input meet incoming inspection condition.
In the present embodiment, concrete, whether the data of judgement input meet the incoming inspection condition on node, wherein, in advance with tree structure configuration incoming inspection condition, the corresponding switch labels of incoming inspection condition on each node; If meet, preserve the switch labels corresponding with incoming inspection condition on this node.If meet predetermined condition between the judged result of the incoming inspection condition on all nodes, judge inputted data and meet incoming inspection condition.
Further, in this example, can judge between the judged result of the incoming inspection condition on all nodes, whether to meet predetermined condition by following steps:
1) judgement belongs between the judged result of the incoming inspection condition in all child nodes of same father node whether meet predetermined condition step by step.
In the present embodiment, concrete, the judged result in all child nodes is carried out to logical operation; Whether the result that decision logic computing obtains meets predetermined condition.If meet, belong between the judged result of the incoming inspection condition in all child nodes of same father node and meet predetermined condition.
2), if father node at different levels all meets, the judged result of the incoming inspection condition on all nodes meets predetermined condition.
S104, if meet, 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 meet predetermined condition between the judged result of the incoming inspection condition on all nodes, judge inputted data and meet incoming inspection condition, be the additional switch labels of preserving of data of input.
S106, the state that the data of input are carried out being indicated by switch labels is changed.
In the present embodiment, concrete, the state that respectively data of input is carried out being indicated by each switch labels according to the order of each switch labels is changed.
S108, upgrades label to the data additivity after conversion.
S110, judges that state upgrades label and whether meets output test condition.
Concrete, judge that state upgrades label and whether meets the output test condition on node, wherein, in advance with tree structure configuration output test condition, the corresponding a kind of processing rule of output test condition on each node; If meet, preserve the processing rule corresponding with output test condition on this node.If meet predetermined condition between the judged result of the output test condition on all nodes, judgement state upgrades the satisfied output of label test condition.
In the present embodiment, can judge between the judged result of the output test condition on all nodes, whether to meet predetermined condition by following steps:
1) judgement belongs between the judged result of the output test condition in all child nodes of same father node whether meet predetermined condition step by step.
Concrete, the judged result in all child nodes is carried out to logical operation; Whether the result that decision logic computing obtains meets predetermined condition.If meet, belong between the judged result of the output test condition in all child nodes of same father node and meet predetermined condition.
2), if father node at different levels all meets, between the judged result of the output test condition on all nodes, meet predetermined condition.
S112, if meet, exports processing according to the processing rule that output test condition is corresponding to the data after changing.
Concrete, according to the processing rule of preserving, the data after changing are exported to processing.
In the present embodiment, the third party who is positioned at 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 meet output test condition when the data of input do not meet incoming inspection condition.
Below in conjunction with specification drawings and specific embodiments, the invention will be further described.
In conjunction with the enforcement of the publishing system of network-oriented, this system mainly completes publishes the collection of relevant information and realizes by database publishing mode the system that the space of a whole page generates automatically; Wherein publish relevant information spinner and will comprise two aspects: publish 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 refers to the space of a whole page pattern of publishing by definition, and after the mapping relations between space of a whole page element and Database field, a kind of publishing way that system can Mass production space of a whole page unit.
Fig. 2 is according to the schematic diagram of the state machine function module of the embodiment of the present invention.As shown in Figure 2, according to the state machine 11 of the embodiment of the present invention, comprise: load module 12, state modular converter 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 to rely on the Message Processing queue that state machine is accepted to realize, 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 message response module can be processed one by one; Message trigger device makes message response module can mate and call according to information the built-in function processing function of state machine.
First, message trigger 21 triggers state machine 11, after state machine indication load module 12 Reset Status, accepts data.There is Data buffer in load module 12, external data can not tested and directly be entered in this Buffer Pool etc. pendingly, leaves effective survival period that data in Data buffer have setting in, exceeds this survival period deleted.In practice system, load module 12 and other common grounds share the Data buffer of appointment.
According to the data input channel configuration file of the embodiment of the present invention, can be:
<？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, the data block that is 23221 due to ID is the ad material that advertising agent is made, pass through " checkproxy (@ID) " function verification succeeds of " advertisement agency's submission " node, wherein, the formula expression that checkproxy (@ID) supports for state machine in the present embodiment, be that checkproxy is the call function that state machine is supported, ID refers to the ID of application call data, and wherein symbol represents that this is the ID of input object as function input parameter ID;
" checkproxy (@ID) " function verification succeeds of " if advertisement agency's submission " node, the check that 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 license in publishing in the original plan, advertisement layout size, the verification checkplan (@ID) of ad material requirement etc., if above-mentioned verification is still successful, the check that finds father node " audit of the paying the fees " node of " advertisement submission " node proceeds verification, carry out the function verification checkfee@ID that advertising expenditure is paid).
As all successes of above-mentioned verification, finally carry out the verification of " qualified buffer memory ", in the present embodiment, this node does not arrange verification, and the data block that ID is 23221 is copied to state machine inside.As above-mentioned verification exists unsuccessfully, or do not find entry node, load module feeds back corresponding abnormality code to message management module, and external program obtains abnormality code from message management module, or sends abnormality code to designated program address by message management module.
Here it should be noted that, after 12 pairs of data detection successes of above-mentioned load module, related data is copied to state machine inside, rather than simply quote, state machine data is followed following principle, guarantee integrality and the correctness of legacy data,, before obtaining processing object modification, after copy data object, copy data object is modified, after data modification completes, by output module output, replace legacy data object, after data handling procedure is cancelled, do not affect legacy data object.For the data object of not supporting many concurrent processing, by record the state of " by operable lock " flag data that limiting lock fixes time in data object.
Data object, by after the verification of load module 12, records the action sequence of the xml node of verification passage.In above-described embodiment, " advertisement agency's submission " node record " package33 " function, is also a formula expression, represents to call " packing material sends " 33 state transition process in state machine; " advertisement submission " node record " printblock32 " function, represents to call " backstage generates sample and sends " 32 state transition process in state machine; " qualified buffer memory " node record " refreshstatic31 " function, represents to call " renewal of space of a whole page statistic " 31 state transition process in state machine.
Above-mentioned three state transition process, three parallel state transition process of definition in state machine 11, as shown in Figure 3, wherein " renewal of space of a whole page statistic " 31 state conversions are that the record that advertisement is published is updated in space of a whole page status data so that the supervision of space of a whole page state and the disbursement and sattlement in later stage etc.; " backstage generates sample and sends " 32 state transition process are for utilizing template generating advertisement information in EPS or the PDF sample of the corresponding space of a whole page, and the later stage does not need to revise to be directly used in spells large version; " packing material sends " 33 state transition process are the advertisement related materials that may need modification by follow-up, after template typesetting, together with packings such as materials, output to assigned address.
After state modular converter 13 receives data object, data object is carried out to state transition process.Concrete, state modular converter 13 upgrades the order of processing label according to state additional on data object, successively data object is carried out to data conversion treatment, the state transition process label being attached on data object is that data object is after node check in data input channel configuration file, the action attribute obtaining from node, and the path that is started to form by access check node sequentially sorts, if the action attribute of node exists and repeats on the path of data check, data object does not record the action attribute being recorded in data object.
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 in processing procedure, occur various abnormal.
State modular converter 13 calls in state transition process process, and to the additional output identification of data object, after the state conversion of complete paired data object, state machine 11 consigns to output module 14 by data object, and carries out output verification by output module 14.
According to the data output channel configuration file of the embodiment of the present invention, can be:
<？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, from data node, is found all child nodes successively, as found to exist the node of valve attributes match, carries out the action defining in aim attribute.
For example, when after " renewal of space of a whole page statistic " 31 state transition process, data object obtains mark " refreshstatic " corresponding to " renewal of space of a whole page statistic ", after qualified when searching out " adjustment of the printing plate numbering " node, carry out the content of aim attribute definition, http: // 198.23.11.121/webservice/caiwu.asmx? obj=@ID, wherein aim nodal value is also a formula expression, and wherein ID represents that name is called the parameter of ID from the ID of data object.The processing of other nodes is also the same.
The output verification of above-mentioned output module can be found out, after data object process output verification, in fact the outgoing route of many can be set, and is multiple goal output data.
In the Data buffer that generally output module is formulated the data output after processing.
In above-described embodiment, state machine 11 is stateless state machine, it is the device that itself does not comprise data storage, and in practice, also have the state machine of state, be the device that itself comprises data storage, data, through after input media, can be preserved in the data storage device of state machine itself, whether these data carry out state transition process, by message management apparatus, trigger.
Here, at output terminal, with tree structure, configuring output search condition (for example, printblock, package etc.) is a kind of preferred mode, and for example, each output search condition can also be coordination.
According to the embodiment of the present invention, can realize and generate complicated state machine application system, this system is adapted at using under the environment of the distribute network application.The interface method for normalizing based on template simultaneously, not only solves the version problem of state machine, can also make state machine call very simple.
Effect of the present invention is: by by interface simplification, the standardization of input and output, under the design of " data-driven (Data Driver) ", state machine is out relatively independent, and by the interface normalization of input and output, any state machine node can simply be inserted on the digraph of state machine, can not affect the operation of whole state machine.Specifically, the embodiment of the present invention has following effects:
1) state machine of setting up by method of the present invention, can realize dynamic adjustment, real-time dynamic test, and part is upgraded, and can not have influence on the stability of whole system.
2) the present invention, by input and output and the structurized configuration template of xml based on xml structural data, can dispose easily state machine, and can support the data mode conversion process of multilayer nest at net 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 process the needs of a large amount of recurrence, layering, the application scenario such as distributed.
Why the present invention has above-mentioned remarkable result, its reason is: the feature of utilizing xml tree structure data that the present invention is based on foundation, set up data mode migration " pipeline ", and data oriented flowing in state machine controlled in the node verification " valve " of the interface by input and output, and sets up the association between inter-process link by " label ".Above-mentioned innovation setting, has realized based on a kind of new state machine system data template, data-centered, that message is bonding agent.
Device embodiment
According to embodiments of the invention, provide a kind of disposal system of state machine.
Fig. 4 is according to the structured flowchart of the disposal system of the state machine of the embodiment of the present invention.As shown in Figure 4, this disposal system comprises: load module 402 for judging whether the data of input meet incoming inspection condition, and is the data additional conversion label of input satisfied in the situation that, and wherein, incoming inspection condition and switch labels have corresponding relation; State modular converter 404, changes for the state that the data of input are carried out being indicated by switch labels, and after conversion, the data additivity after conversion is upgraded to label; ; Output module 406 for judging that state upgrades label and whether meets output test condition, and is exported processing according to processing rule corresponding to output test condition to the data after changing satisfied in the situation that.
Said system can also comprise: message management module 408, and for the result of state machine being sent to by message interface to the third party who is positioned at state machine outside.
The disposal system of the state machine in the present embodiment can adopt the disposal route in said method embodiment to process state machine, therefore the workflow to the disposal system of state machine repeats no more at this.
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, by simplifying and unify the parametric form of IO interface, can also support to meet the input and output requirement of multiple otherness, and the multinest of status of support machine and part renewal, thereby make it possible to be applied to easily the application scenario of net environment, particularly towards the network calculations of many agencies, mobile agent, apply.
It should be noted that, in the step shown in the process flow diagram of accompanying drawing, can in the computer system such as one group of computer executable instructions, carry out, and, although there is shown logical order in flow process, but in some cases, can carry out shown or described step with the order being 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 general calculation element, they can concentrate on single calculation element, or be distributed on the network that a plurality of calculation elements form, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in memory storage and be carried out by calculation element, or they are made into respectively to each integrated circuit modules, or a plurality of modules in them or step are made into single integrated circuit module to be realized.Like this, the present invention is not restricted to any specific hardware and software combination.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (13)
1. a disposal route for state machine, is characterized in that, comprising:
Whether the data that judge described input meet incoming inspection condition;
If meet, be the data additional conversion label of described input, wherein, described incoming inspection condition and described switch labels have corresponding relation;
The state that the data of described input are carried out being indicated by described switch labels is changed;
Data additivity after conversion is upgraded to label;
Judge that described state upgrades label and whether meets output test condition;
If meet, the data according to processing rule corresponding to described output test condition after to described conversion are exported processing.
2. method according to claim 1, is characterized in that,
Whether the data that judge described input meet incoming inspection condition specifically comprises:
Whether the data of judgement input meet the incoming inspection condition on node, wherein, in advance with tree structure configuration incoming inspection condition, the corresponding switch labels of incoming inspection condition on each node;
If meet, preserve the switch labels corresponding with incoming inspection condition on this node;
If meet predetermined condition between the judged result of the incoming inspection condition on all nodes, judge that the data of described input meet incoming inspection condition; For the data additional conversion label of described input specifically comprises:
The additional described switch labels of preserving of data for described input.
3. method according to claim 2, is characterized in that, the state conversion that the data of described input are carried out being indicated by described switch labels specifically comprises:
The state that respectively data of described input is carried out being indicated by each switch labels according to the order of each switch labels is changed.
4. method according to claim 1, is characterized in that, judges that described state upgrades the whether satisfied output test condition of label and specifically comprises:
Judge that described state upgrades label and whether meets the output test condition on node, wherein, in advance with tree structure configuration output test condition, the corresponding a kind of processing rule of output test condition on each node;
If meet, preserve the processing rule corresponding with output test condition on this node;
If meet predetermined condition between the judged result of the output test condition on all nodes, judge that described state upgrades label and meets output test condition.
5. method according to claim 4, is characterized in that, the data according to processing rule corresponding to described output test condition after to described conversion are exported to process and specifically comprised:
Data according to the described processing rule of preserving after to described conversion are exported processing.
6. method according to claim 2, is characterized in that, judges between the judged result of the incoming inspection condition on all nodes, whether to meet predetermined condition by following steps:
Judgement belongs between the judged result of the incoming inspection condition in all child nodes of same father node whether meet predetermined condition step by step;
If father nodes at different levels all meet, the judged result of the incoming inspection condition on all nodes meets predetermined condition.
7. method according to claim 6, is characterized in that, judges whether the judged result of the incoming inspection condition in all child nodes that belong to same father node meets predetermined condition by following steps:
Judged result in described all child nodes is carried out to logical operation;
Whether the result that decision logic computing obtains meets described predetermined condition.
8. method according to claim 4, is characterized in that, judges between the judged result of the output test condition on all nodes, whether to meet predetermined condition by following steps:
Judgement belongs between the judged result of the output test condition in all child nodes of same father node whether meet predetermined condition step by step;
If father nodes at different levels all meet, between the judged result of the output test condition on all nodes, meet predetermined condition.
9. method according to claim 8, is characterized in that, judges whether the judged result of the output test condition in all child nodes that belong to same father node meets predetermined condition by following steps:
Judged result in described all child nodes is carried out to logical operation;
Whether the result that decision logic computing obtains meets 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. methods 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 meet output test condition when the data of described input do not meet incoming inspection condition.
The disposal system of 12. 1 kinds of state machines, is characterized in that, comprising:
Load module for judging whether the data of described input meet incoming inspection condition, and is the data additional conversion label of described input satisfied in the situation that, and wherein, described incoming inspection condition and described switch labels have corresponding relation;
State modular converter, changes for the state that the data of described input are carried out being indicated by described switch labels, and after conversion, the data additivity after conversion is upgraded to label;
Output module, for judging that described state upgrades label and whether meets output test condition, and satisfied in the situation that according to processing rule corresponding to described output test condition the data after to described conversion export processing.
13. systems according to claim 12, is characterized in that, described system further comprises:
Message management module, for sending to the result of described state machine by message interface 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 CN102109984A (en) | 2011-06-29 |
| CN102109984B true 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) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103176896B (en) * | 2011-12-23 | 2015-08-26 | 阿里巴巴集团控股有限公司 | A kind of generation method of test case and device |
| 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 |
| CN109542664B (en) * | 2018-12-13 | 2024-07-16 | 平安科技（深圳）有限公司 | File verification method and device based on artificial intelligence and computer equipment |
| CN115048160B (en) * | 2022-06-21 | 2023-04-07 | 中国人民解放军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 (3)
| Title |
|---|
| 刘勇等.面向内容的有限状态网络服务模型.《电子学报》.2008,第36卷(第10期), |
| 闫新庆等.无线射频识别***中的事件处理机制.《华中科技大学学报（自然科学版）》.2008,第36卷(第9期), * |
| 面向内容的有限状态网络服务模型;刘勇等;《电子学报》;20081031;第36卷(第10期);第1897-1902页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102109984A (en) | 2011-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102109984B (en) | Method and system for processing state machine | |
| US8776009B2 (en) | Method and system for task modeling of mobile phone applications | |
| CN111176867B (en) | Data sharing exchange and open application platform | |
| CN103927174A (en) | Service processing method and device | |
| US11669599B2 (en) | Systems and methods for software license management | |
| CN107274023A (en) | Flow of insuring generation method, insure request processing method and device and electronic equipment | |
| CN104331366A (en) | Test case design efficiency promotion method and system | |
| US9299049B2 (en) | Contract-based process integration | |
| Falkenthal et al. | Requirements and enforcement points for policies in industrial data sharing scenarios | |
| CN111177126B (en) | Information processing method, device and equipment | |
| Koç et al. | Capability-driven development: a novel approach to design enterprise capabilities | |
| CN106600149A (en) | Process analysis method and apparatus | |
| CN112183991A (en) | Power plant data management method and system, electronic equipment and storage medium | |
| Spies | A software assurance evidence approach to cloud security | |
| Schoenenwald et al. | Collecting and visualizing data lineage of Spark jobs: Digesting Spark execution plans to surface lineage graphs via a full-stack application | |
| Vekris et al. | Efficient Operational Semantics for for Verification of Temporal Properties | |
| Reggiani et al. | A software framework for process control in the agroindustrial sector | |
| Pulgarín et al. | Cost Estimate Migration for Crystal Reports | |
| CN118427218A (en) | State information configuration method and device, electronic equipment, storage medium and computer program product | |
| Dalal | Model Callers for Transforming Predictive and Generative AI Applications | |
| CN113360201A (en) | Calculation task obtaining method and device, storage medium and electronic equipment | |
| CN117036018A (en) | Data processing method and device and electronic equipment | |
| CN118260199A (en) | Test method, test device, electronic equipment and computer readable medium | |
| CN116414642A (en) | Function test method and related device of service node | |
| CN116414880A (en) | Feature engineering method and device and electronic equipment |
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 |