CN103559044A - Method and device for formalizing network control codes of wireless sensor - Google Patents
Method and device for formalizing network control codes of wireless sensor Download PDFInfo
- Publication number
- CN103559044A CN103559044A CN201310590424.3A CN201310590424A CN103559044A CN 103559044 A CN103559044 A CN 103559044A CN 201310590424 A CN201310590424 A CN 201310590424A CN 103559044 A CN103559044 A CN 103559044A
- Authority
- CN
- China
- Prior art keywords
- limit
- control flow
- node
- task
- flow graph
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method and a device for formalizing a network control code of a wireless sensor. The method comprises the following steps: generating a control flow graph, a task announcement tree and a task graph of the control code, wherein the control flow graph comprises at least one sub-control graph corresponding to a subroutine; adding network edges among sub-control graphs belonging to different network elements in the control flow graph according to data interaction between different network elements in the control code; adding idle nodes for the network elements in the control flow graph, and adding ghost edges for the idle nodes; adding seizing edges and corresponding backtracking edges for seized nodes in the control flow graph; adding corresponding task edges in the control flow graph through referring to each edge in the task graph. The device and the method have the advantage that a programmer can understand the control logics of network control code of the wireless sensor conveniently.
Description
Technical field
The present invention relates to wireless sensor network technology field, relate in particular to wireless sensor network control routine formalization method and device.
Background technology
Wireless sensor network is one of focus of studying both at home and abroad at present.It is comprised of the sensor of a large amount of cheapnesss, the network system forming by the self-organization of wire/wireless communication mode, mutual perception collaboratively data around.Because wireless sensor node is a kind of typical resource-constrained embedding people formula system, need a miniature operating system to carry out organization and management hardware, realize the function of application software.TinyOS be Univ California-Berkeley design for wireless sensor network based on event driven micro operation system, be with compilation and the realization of C language at first.Because C language can not meet the application and development of facing sensing device network effectively, easily, its object code is long, has designed after further study novel programmed language---the NesC of supporting assembly.Its maximum feature is to combine by modularization/modularization idea with based on event driven execution model.
NesC application is mainly by drives interrupts.When interrupting occurring for one, TinyOS is translated as an event by this interruption, and this event is sent to a target NesC application.The application program subroutine of an asynchronous operation in response to interrupt event is marked by keyword async.For convenient, people are called such subroutine asynchronous event handling procedure (asynchronous event handler, AEH) conventionally.The button.onrelease that does not mark async keyword can only be by other task calls.Program development personnel often design AEH and solve interruption, release tasks, to complete corresponding function.Each AEH can seize the execution of other programs, unless the program being preempted is an atomic block, because in NesC language, atomic block is the program block automatically performing.Yet being published of task might not be carried out immediately.Unlike traditional calling-return mechanisms, task issue mechanism is to be only placed in a task queue task as last task.And task is until be just performed while not coming the task before it in described task queue.Once carry out, this task is moved until task finishes.
Because NesC language combines modularization and based on event driven thought, the source program of NesC language often relates to the data interaction between a plurality of wireless sensor network nodes simultaneously, therefore very complicated by the steering logic in the source program of NesC language compilation, this has brought inconvenience to the exploitation of source program and debugging to program development and tester.
Summary of the invention
In view of this, the present invention proposes a kind of wireless sensor network control routine formalization method and device, to facilitate programmer to understand the steering logic of wireless sensor network control routine.
First aspect, the embodiment of the present invention provides a kind of wireless sensor network control routine formalization method, and described method comprises:
Utilize compiler to generate control flow graph, task issue tree and the task image of control routine, wherein, described control flow graph comprises that at least one is corresponding to the subset control flow figure of a subroutine;
According to the data interaction between different network elements in control routine, in described control flow graph, add the network edge between the subset control flow figure that belongs to different network elements;
In described control flow graph, be the idle node of each network element interpolation, and be that described idle node adds ghost limit;
In described control flow graph, for being preempted node, each adds the limit of recalling of seizing limit and correspondence;
With reference to each limit in described task image, in described control flow graph, add corresponding task limit.
Second aspect, the embodiment of the present invention provides a kind of wireless sensor network control routine formalization device, and described device comprises:
Control flow graph generation module, for utilizing compiler to generate control flow graph, task issue tree and the task image of control routine, wherein, described control flow graph comprises that at least one is corresponding to the subset control flow figure of a subroutine;
Network edge adds module, for according to the data interaction between control routine different network elements, adds the network edge between the subset control flow figure that belongs to different network elements in described control flow graph;
Module is added on idle node and ghost limit, for described control flow graph for each network element adds idle node, and be described idle node interpolation ghost limit;
Seize limit and recall limit and add module, for adding for each is preempted node the limit of recalling of seizing limit and correspondence at described control flow graph;
Module is added on task limit, for each limit with reference to described task image, adds corresponding task limit in described control flow graph.
Wireless sensor network control routine formalization method and device that the embodiment of the present invention provides, by compiler, generate and control flow graph, task issue tree and task image, according to task issue tree and task image, in controlling flow graph, add network edge, ghost limit, seize limit, recall limit and task limit again, built and allowed program development personnel network context easier to understand control flow graph (Network context control flow graph, NCCFG), make the easier steering logic of understanding wireless sensor network control routine of program development personnel energy.
Accompanying drawing explanation
By reading the detailed description that non-limiting example is done of doing with reference to the following drawings, it is more obvious that other features, objects and advantages of the present invention will become:
Fig. 1 is the process flow diagram of the wireless sensor network control routine formalization method that provides of first embodiment of the invention;
Fig. 2 is the schematic diagram of the control flow graph of the wireless sensor network control routine that provides of first embodiment of the invention;
Fig. 3 is the task issue tree of the wireless sensor network control routine that provides of first embodiment of the invention;
Fig. 4 is the task image of the wireless sensor network control routine that provides of first embodiment of the invention;
Fig. 5 is the schematic diagram that network context that the wireless sensor network control routine formalization method that provides of first embodiment of the invention generates is controlled flow graph;
Fig. 6 is the structural drawing of the wireless sensor network control routine formalization device that provides of first embodiment of the invention.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.Be understandable that, specific embodiment described herein is only for explaining the present invention, but not limitation of the invention.It also should be noted that, for convenience of description, in accompanying drawing, only show part related to the present invention but not full content.
Fig. 1 to Fig. 5 shows the first embodiment of the present invention.
Fig. 1 is the process flow diagram of the wireless sensor network control routine formalization method that provides of first embodiment of the invention.The wireless sensor network control routine formalization method that the present embodiment provides is applied in the calculation element that the control routine of wireless sensor network is compiled.Concrete, the described calculation element that the control routine of wireless sensor network is compiled is to comprise any calculation elements that can compile the NesC control routine of wireless sensor network such as PC, workstation, server.Referring to Fig. 1, described wireless sensor network control routine formalization method comprises:
Step S110, utilizes compiler to generate control flow graph, task issue tree and the task image of control routine, and wherein, described control flow graph comprises that at least one is corresponding to the subset control flow figure of a subroutine.
The object of the present embodiment is to provide the network context that represents wireless sensor network control routine to control flow graph (Network context control flow graph, NCCFG).And network context control flow graph is to generate according to the control flow graph (Control flow graph, CFG) of the control routine of compiler generation, task issue tree (Task posting tree, TPT) and task image (Task graph, TG).Therefore, first utilize compiler to generate control flow graph, task issue tree and the task image of control routine.
Described control flow graph is the abstract data structure being used in compiler.It is the abstraction of a process or program, by compiler at internal maintenance.Each node in figure represents an atomic block, for example, and without any the straight line code block of jump or jump target; Jump target is with a BOB(beginning of block), and with a block end.Directed edge is used to the redirect of representative in controlling stream.
The task issue tree of a subroutine m is one and is described to G
tPT(m)=(V
m, E
m) directed tree.Here V
mrepresent all summits in tree, E
mrepresent all directed edges in tree.In task issue tree, each summit is an issue (post) statement of controlling in flow graph.
For any limit e<v
i, v
j> ∈ E
m, two attributes need to be described: if there is a limit e<v
i, v
j> ∈ E
m, we say v
idomination v
j, i.e. v
jv
ichild node, be expressed as v
i→ v
j; If have one from v
kto v
iissue (post) statement, we say v so
kdomination v
j, i.e. v
jv
kchild node, be expressed as v
k→ v
j.
The task image of a subroutine m is one and is described to G
tG(m)=(V
m, E
m) digraph, V here
mrepresent the set of task component in subroutine m, E
mrepresent execution sequence possible between these tasks.If there is a limit e<v
i, v
j> ∈ E
m, we say v
jlikely at v
ioperation afterwards.
The generative process that the network context of control routine of the wireless sensor network that carries out monitoring temperature of take is controlled flow graph is example, and the wireless sensor network control routine formalization method that the present embodiment is provided describes.Described control routine of carrying out the wireless sensor network of monitoring temperature is mainly used in utilizing wireless sensor network to monitor temperature around.
In the control routine of wireless sensor network of carrying out monitoring temperature, defined two kinds of events, a kind of is monitoring temperature data Collection Events, and another kind is monitoring temperature data receiver event.Described monitoring temperature data Collection Events are when a network element, also a wireless senser has carried out the monitoring of a period of time to temperature around, and the monitoring temperature data preparation has during this period of time been become to packet, the event triggering in the time of can externally transmitting this packet.Described monitoring temperature data receiver event is to receive when a network element event triggering when other network elements receive the monitoring temperature data that other network elements send.
When described monitoring temperature data are when Collection Events has been triggered, described network element start-up temperature monitor data has been collected the processing that subroutine completes the monitoring temperature data to having collected.In the process of processing that completes the monitoring temperature data to having collected, described monitoring temperature data have been collected subroutine and have been issued task 1.
When the described monitoring temperature data receiver time is triggered, described network element start-up temperature monitor data receives the processing that subroutine completes the monitoring temperature data that other network element is sent.In the process of processing that completes the monitoring temperature data that other network element is sent, described monitoring temperature data receiver subroutine has been issued task 2.
In addition, in the implementation of task 1, issued task 3.
Fig. 2 is the schematic diagram of the control flow graph of the wireless sensor network control routine that provides of first embodiment of the invention.Each subroutine of network element A and network element B has been shown in Fig. 2.Wherein, the subroutine of network element A comprises the monitoring temperature data receiver subroutine of network element A, the monitoring temperature data of network element A have been collected the subroutine of task 1 correspondence of subroutine and network element A.The subroutine of network element B comprises the monitoring temperature data receiver subroutine of network element B.It should be noted that, in order to simplify the control flow graph of described wireless sensor network control routine, the task 2 of network element A and the subroutine of task 3 correspondences are, the monitoring temperature data of network element B have been collected the subroutine of task 1, task 2 and task 3 correspondences of subroutine and network element B does not all have shown in Figure 2.
Referring to Fig. 2, described control flow graph is by representing that the node of the atomic block in program and the directed edge between node form.Described atomic block is the fundamental block that can not be split during program is carried out, and that is to say, when network element is carried out the processing of described atomic block inside, the processing of described atomic block inside can not be seized by other subroutines.
Directed edge between described atomic block is used for representing the redirect of control routine between different atomic block.
Fig. 3 is the task issue tree of the wireless sensor network control routine that provides of first embodiment of the invention.Referring to Fig. 3, because monitoring temperature data have been collected subroutine and have been issued task 1, monitoring temperature data receiver subroutine has been issued task 2, and the subroutine of task 1 correspondence has been issued task 3, so monitoring temperature data have received subroutine domination task 1, monitoring temperature data receiver subroutine domination task 2, and task 1 is arranged task 3.
Fig. 4 is the task image of the wireless sensor network control routine that provides of first embodiment of the invention.Limit in task image is mainly used in the sequential that represents that network element switches between different tasks.Referring to Fig. 4, after task 1 is complete, described network element may execute the task 1 again, also likely then execute the task 2 or task 3, so in Fig. 4, have the limit of pointing to respectively task 2 and task 3 from task 1.Also have from the limit of task 1 sensing task 1 self.
Step S120 according to the data interaction between different network elements in control routine, adds the network edge between the subset control flow figure that belongs to different network elements in described control flow graph.
Obtain control flow graph, task issue tree and the task image of described control routine by compiler after, the calculation element of applying described wireless sensor network control routine formalization method be take described control flow graph as basis, and controls flow graph according to the logical relation structure network context of described task issue tree and the indication of described task image.
Described calculation element retains all nodes in described control flow graph and the directed edge between node, and builds described network context and control flow graph by adding specific node and limit in the control flow graph original.
Described network context control flow graph by controlling flow graph, network edge, ghost limit, seize limit, recall the hexa-atomic information group that limit and task limit form.Therefore, the network context that builds wireless sensor network control routine is controlled flow graph, need on control flow graph, add network edge, ghost limit, seizes limit, recalls limit and appoint military limit.
Described network edge is for representing that the data stream of wireless sensor network is mutual.While controlling flow graph interpolation network edge for network context, need to identify the mutual statement of executing data in control routine, and according to the flow direction of the Semantic judgement data stream of the mutual statement of executing data.After the identification of complete paired data alternate statement and Data flow direction, on described control flow graph, add the network edge by node corresponding to the statement of node sensing receiving data stream corresponding to the statement of initiating data stream.
Fig. 5 is the schematic diagram that network context that the wireless sensor network control routine formalization method that provides of first embodiment of the invention generates is controlled flow graph.Referring to Fig. 5, the network edge of controlling flow graph interpolation for network context is by node n13, to be pointed to the limit of node n18.
It should be noted that, in order to make network context control flow graph more succinct, the subset control flow figure of task 2 and task 3 correspondences of network element A is not shown in Fig. 5.
Step S130 is the idle node of each network element interpolation, and is that described idle node adds ghost limit in described control flow graph.
In wireless sensor network, if occurred without any event at a network element place, this network element is in idle state.When only having this network element place event occurs, this network element is just waken up from original idle state.In order to indicate this idle state of network element, described network context is controlled in flow graph and has been introduced idle node.
Ghost limit is for representing the process that a network element enters idle state and is waken up from described idle state.Identical with described network edge, described ghost limit is also to form described network context to control a kind of information in the hexa-atomic information group of flow graph.In building the process of network context control flow graph, need in controlling flow graph, add ghost limit.
In described control flow graph, for adding, each network element belongs to after the idle node of this network element, for this network element adds ghost limit.Described ghost limit comprises the ghost limit of Ingress node of pointing to each subset control flow figure of this network element from described idle node, and the ghost limit of pointing to described idle node from the Egress node of each subset control flow figure of this network element.The process of the ghost limit of the Ingress node of described each subset control flow figure that points to this network element from idle node for representing that this network element is waken up from idle state, and the Egress node of described each subset control flow figure from this network element points to the ghost limit of described idle node for representing that this network element enters the process of idle state.
For network context, controlling in the process on flow graph interpolation ghost limit, both need on described control flow graph, add the ghost limit of directly putting the Ingress node of each subset control flow figure that points to this network element from described elder generation, need on described control flow graph, add again from the ghost limit of the Egress node of each subset control flow figure of this network element.
At the network context shown in Fig. 5, control in flow graph, ghost limit comprises from the limit of node n5 sensing node n0, from node n0, points to the limit of node n1 and the limit of pointing to node n17 from node n22.
Step S140 adds for each is preempted node the limit of recalling of seizing limit and correspondence in described control flow graph.
Owing to having adopted event driven execution mechanism in NesC, network element is when carrying out a subroutine, if there are other events to occur, network element can produce an interruption, time-out is carried out the continuation of the subroutine of carrying out, then carries out the subroutine of processing event.When process the subroutine of event complete after, described network element continues to carry out interrupted subroutine.Described network element is in carrying out the process of a subroutine, and the process of transferring the subroutine of execution processing generation event is called as to be seized.And complete after the subroutine of processing event, the process that continues the original subroutine of carrying out of execution is called as to be recalled.
At network context, control in flow graph, seize limit for representing possible seizing between subroutine, and recall limit for representing recalling between subroutine.Therefore,, when building described network context control flow graph, need on control flow graph, add and seize limit and recall limit.
The Ingress node of seizing subset control flow figure is pointed to from being preempted node in the described limit of seizing, describedly recall limit and point to and to be preempted node from seizing the Egress node of subset control flow figure, wherein, described in, be preempted the affiliated subroutine of node is to seize the child node of seizing subroutine that subset control flow figure is corresponding in described task issue tree.
At the network context shown in Fig. 5, control in flow graph, seize limit and comprise from the limit of node n12 sensing node n1 and the limit of pointing to node n1 from node n14, recall limit and comprise from the limit of node n5 sensing node n12 and the limit of pointing to node n14 from node n5.
Step S150 with reference to each limit in described task image, adds corresponding task limit in described control flow graph.
Task image is for representing the process that network element switches between different tasks.In order further to represent the handoff procedure of network element between different task, at network context, control in flow graph and introduced task limit.
Task limit is for representing the switching of network element between different tasks.In the Egress node sensing task image of pointing out the subset control flow figure that subroutine is corresponding on limit from task image, task limit, the finger on this limit enters the Ingress node of subset control flow figure corresponding to subroutine.Suppose the network element b that can execute the task after a that executes the task, need to control and in flow graph, add the task limit of pointing to the Ingress node of task b from the Egress node of task a at network context.
At the network context shown in Fig. 5, control in flow graph, task limit comprises the limit of pointing to node n11 from node n16.
It should be noted that, due to the subset control flow figure of Fig. 5 not shown task 2 and task 3 correspondences, thus the task limit of the switching between expression task 1 and task 2 or task 3, and the task limit of the switching between expression task 2 and task 3 does not illustrate in Fig. 5.
The present embodiment is by utilizing compiler to generate control flow graph, task issue tree and the task image of control routine, according to task issue tree and task image, in controlling flow graph, add network edge, ghost limit, seize limit, recall limit and task limit again, generated for representing the network context control flow graph of the steering logic of control routine, made the easier steering logic of understanding wireless sensor network control routine of program development personnel energy.
Fig. 6 shows the second embodiment of the present invention.
Fig. 6 is the structural drawing of the wireless sensor network control routine formalization device that provides of first embodiment of the invention.Referring to Fig. 6, described wireless sensor network control routine formalization device comprises: control flow graph generation module 610, network edge add module 620, idle node and ghost limit and add module 630, seize limit and recall limit and add module 640 and task limit interpolation module 650.
Described control flow graph generation module 610 is for utilizing compiler to generate control flow graph, task issue tree and the task image of control routine, and wherein, described control flow graph comprises that at least one is corresponding to the subset control flow figure of a subroutine.
Described network edge adds module 620 for according to the data interaction between control routine different network elements, adds the network edge between the subset control flow figure that belongs to different network elements in described control flow graph.
Described network edge sends the corresponding node of the source network element of data and points to the corresponding node that receives the place network element of data in data interaction from data interaction.
Described idle node and ghost limit add module 630 for described control flow graph for each network element adds idle node, and be described idle node interpolation ghost limit.
Described ghost limit comprises the ghost limit of Ingress node of pointing to each subset control flow figure of this network element from described idle node, and the ghost limit of pointing to described idle node from the Egress node of each subset control flow figure of this network element.
Describedly seize limit and recall limit and add module 640 for adding for each is preempted node the limit of recalling of seizing limit and correspondence at described control flow graph.
The Ingress node of seizing subset control flow figure is pointed to from being preempted node in the described limit of seizing, describedly recall limit and point to and to be preempted node from seizing the Egress node of subset control flow figure, wherein, described in, be preempted the affiliated subroutine of node is to seize the child node of seizing subroutine that subset control flow figure is corresponding in described task issue tree.
In the Egress node sensing task image of pointing out the subset control flow figure that subroutine is corresponding on limit from task image, described task limit, the finger on this limit enters the Ingress node of subset control flow figure corresponding to subroutine.
The present embodiment is by utilizing compiler to generate control flow graph, task issue tree and the task image of control routine, in controlling flow graph, add network edge, ghost limit again, seize limit, recall limit and task limit, generated for representing the network context control flow graph of the steering logic of control routine, made the easier steering logic of understanding wireless sensor network control routine of program development personnel energy.
The invention described above embodiment sequence number, just to describing, does not represent the quality of embodiment.
Those of ordinary skills 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 realize with the executable program code of computer installation, 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 realize.Like this, the present invention is not restricted to the combination of any specific hardware and software.
Each embodiment in this instructions all adopts the mode of going forward one by one to describe, and each embodiment stresses is the difference with other embodiment, the identical similar part between each embodiment mutually referring to.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, to those skilled in the art, the present invention can have various changes and variation.All any modifications of doing, be equal to replacement, improvement etc., within protection scope of the present invention all should be included within spirit of the present invention and principle.
Claims (10)
1. a wireless sensor network control routine formalization method, is characterized in that, comprising:
Utilize compiler to generate control flow graph, task issue tree and the task image of control routine, wherein, described control flow graph comprises that at least one is corresponding to the subset control flow figure of a subroutine;
According to the data interaction between different network elements in control routine, in described control flow graph, add the network edge between the subset control flow figure that belongs to different network elements;
In described control flow graph, be the idle node of each network element interpolation, and be that described idle node adds ghost limit;
In described control flow graph, for being preempted node, each adds the limit of recalling of seizing limit and correspondence;
With reference to each limit in described task image, in described control flow graph, add corresponding task limit.
2. method according to claim 1, is characterized in that, described network edge sends the corresponding node of the source network element of data and points to the corresponding node that receives the place network element of data in data interaction from data interaction.
3. method according to claim 1, it is characterized in that, described ghost limit comprises the ghost limit of Ingress node of pointing to each subset control flow figure of this network element from described idle node, and the ghost limit of pointing to described idle node from the Egress node of each subset control flow figure of this network element.
4. method according to claim 1, it is characterized in that, the Ingress node of seizing subset control flow figure is pointed to from being preempted node in the described limit of seizing, describedly recall limit and point to and to be preempted node from seizing the Egress node of subset control flow figure, wherein, described in, be preempted the affiliated subroutine of node is to seize the child node of seizing subroutine that subset control flow figure is corresponding in described task issue tree.
5. method according to claim 1, is characterized in that, in the Egress node sensing task image of pointing out the subset control flow figure that subroutine is corresponding on limit from task image, described task limit, the finger on this limit enters the Ingress node of subset control flow figure corresponding to subroutine.
6. a wireless sensor network control routine formalization device, is characterized in that, comprising:
Control flow graph generation module, for utilizing compiler to generate control flow graph, task issue tree and the task image of control routine, wherein, described control flow graph comprises that at least one is corresponding to the subset control flow figure of a subroutine;
Network edge adds module, for according to the data interaction between control routine different network elements, adds the network edge between the subset control flow figure that belongs to different network elements in described control flow graph;
Module is added on idle node and ghost limit, for described control flow graph for each network element adds idle node, and be described idle node interpolation ghost limit;
Seize limit and recall limit and add module, for adding for each is preempted node the limit of recalling of seizing limit and correspondence at described control flow graph;
Module is added on task limit, for each limit with reference to described task image, adds corresponding task limit in described control flow graph.
7. device according to claim 6, is characterized in that, described network edge sends the corresponding node of the source network element of data and points to the corresponding node that receives the place network element of data in data interaction from data interaction.
8. device according to claim 6, it is characterized in that, described ghost limit comprises the ghost limit of Ingress node of pointing to each subset control flow figure of this network element from described idle node, and the ghost limit of pointing to described idle node from the Egress node of each subset control flow figure of this network element.
9. device according to claim 6, it is characterized in that, the Ingress node of seizing subset control flow figure is pointed to from being preempted node in the described limit of seizing, describedly recall limit and point to and to be preempted node from seizing the Egress node of subset control flow figure, wherein, described in, be preempted the affiliated subroutine of node is to seize the child node of seizing subroutine that subset control flow figure is corresponding in described task issue tree.
10. device according to claim 6, is characterized in that, in the Egress node sensing task image of pointing out the subset control flow figure that subroutine is corresponding on limit from task image, described task limit, the finger on this limit enters the Ingress node of subset control flow figure corresponding to subroutine.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310590424.3A CN103559044A (en) | 2013-11-20 | 2013-11-20 | Method and device for formalizing network control codes of wireless sensor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310590424.3A CN103559044A (en) | 2013-11-20 | 2013-11-20 | Method and device for formalizing network control codes of wireless sensor |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103559044A true CN103559044A (en) | 2014-02-05 |
Family
ID=50013300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310590424.3A Pending CN103559044A (en) | 2013-11-20 | 2013-11-20 | Method and device for formalizing network control codes of wireless sensor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103559044A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105164639A (en) * | 2013-04-23 | 2015-12-16 | 起元科技有限公司 | Controlling tasks performed by computing system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101271397A (en) * | 2007-03-23 | 2008-09-24 | 北京大学 | Recognition method of nested loop structure |
| CN101436128A (en) * | 2007-11-16 | 2009-05-20 | 北京邮电大学 | Software test case automatic generating method and system |
| CN102693133A (en) * | 2012-05-22 | 2012-09-26 | 东南大学 | Coding, executing and decoding method for band path |
-
2013
- 2013-11-20 CN CN201310590424.3A patent/CN103559044A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101271397A (en) * | 2007-03-23 | 2008-09-24 | 北京大学 | Recognition method of nested loop structure |
| CN101436128A (en) * | 2007-11-16 | 2009-05-20 | 北京邮电大学 | Software test case automatic generating method and system |
| CN102693133A (en) * | 2012-05-22 | 2012-09-26 | 东南大学 | Coding, executing and decoding method for band path |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105164639A (en) * | 2013-04-23 | 2015-12-16 | 起元科技有限公司 | Controlling tasks performed by computing system |
| CN105164639B (en) * | 2013-04-23 | 2018-11-09 | 起元科技有限公司 | Control being executed by computing system for task |
| US10489191B2 (en) | 2013-04-23 | 2019-11-26 | Ab Initio Technology Llc | Controlling tasks performed by a computing system using controlled process spawning |
| US10565005B2 (en) | 2013-04-23 | 2020-02-18 | Ab Initio Technology Llc | Controlling tasks performed by a computing system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI407373B (en) | Resource management in a multicore architecture | |
| McCartney et al. | Abstractions for safe concurrent programming in networked embedded systems | |
| CN102520925B (en) | AADL2TASM (Architecture Analysis and Design Language-to-Timed Abstract State Machine) model transformation method | |
| Maqsood et al. | Dynamic task mapping for network-on-chip based systems | |
| CN108255585B (en) | SDK abnormal control and application program operation method, device and equipment thereof | |
| WO2012027907A1 (en) | Method for parallelizing automatic control programs and compiler | |
| CN103593192A (en) | Algorithm integration and evaluation platform and method based on SLURM scheduling | |
| Lai et al. | Inter-context control-flow and data-flow test adequacy criteria for nesc applications | |
| Fu et al. | Development of RTOS-based wireless SHM system: Benefits in applications | |
| Dwivedi et al. | Operating systems for tiny networked sensors: A survey | |
| Zhao et al. | Research on the priority-based soft real-time task scheduling in TinyOS | |
| CN103559044A (en) | Method and device for formalizing network control codes of wireless sensor | |
| CN110007597A (en) | The optimization method of status poll and event driven software state machine design mode | |
| Furfaro et al. | A development methodology for embedded systems based on RT-DEVS | |
| CN113067761B (en) | Linear token data bus simulation platform based on OPNET | |
| Kouloumpris et al. | Reliability-aware task allocation latency optimization in edge computing | |
| Wang et al. | Exploiting event-level parallelism for parallel network simulation on multicore systems | |
| Cho et al. | Toward efficient detection of semantic exceptions in context-aware systems | |
| Babazadeh | LoRa-based anomaly detection platform: Center and sensor-side | |
| Smith et al. | Maze: An extension of object-z for multi-agent systems | |
| Hsiung et al. | Formal synthesis and code generation of real-time embedded software using time-extended quasi-static scheduling | |
| Mousavi et al. | Cyber-Physical Systems | |
| Garousi et al. | A UML-based quantitative framework for early prediction of resource usage and load in distributed real-time systems | |
| CN117271424B (en) | Processing device and processing method based on multimode fusion computing framework | |
| Shin et al. | Performance prediction model generator powered by occurrence graph analyzer of Design/CPN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140205 |
|
| RJ01 | Rejection of invention patent application after publication |