Graphically based method for developing connectivity drivers

• US 8,572,556 B2
• Filed: 12/31/2010
• Issued: 10/29/2013
• Est. Priority Date: 12/31/2010
• Status: Active Grant

• Current Assignee: STARLIMS Corporation
• Original Assignee: STARLIMS Corporation
• Inventors: Rivkin, Slava
• Primary Examiner(s): KENDALL, CHUCK O
• Application Number:
  US12/983,167
• Publication Number:
  US 20120174060A1
• Time in Patent Office: 1,033 Days
• Field of Search: 717100-120
• US Class Current: 717/106
• CPC Class Codes: G06F 2213/0038 System on Chip
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G06F 40/211 Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
• CPC Class Codes: G06F 8/34 Graphical or visual programming
• CPC Class Codes: G16H 10/40 for data related to laboratory analysis, e.g. patient specimen analysis

Abstract

A method for graphically developing a connectivity driver is provided. The method includes inputting a hardware message and a first delimiter into computer readable memory medium and generating a first graphical diagram in response. The graphical diagram includes a first branch having a primary parsing node. The first branch represents the discrete record field within the hardware message. The primary parsing node represents the discrete record field within the hardware message and contains information on how to separate the discrete record field from the hardware message. The method also includes graphically assembling a second graphical diagram in response to user input. The second graphical diagram includes a first state node and a second state node. The first state node is connected with the second state node via a transition. The method also includes converting the first and second graphical diagrams into program code from which the connectivity driver is executed.

Claims

1. A non-transitory computer readable memory medium comprising program instructions for graphically developing a connectivity driver, wherein the program instructions are executable by a processor to:

assemble a first graphical diagram in response to user input, wherein the first graphical diagram represents a parsing sequence for analyzing and converting a hardware message sent using a hardware protocol into software data having a file format readable by a computer program, wherein the entire parsing sequence defines a hardware grammar used to encode and decode discrete fields into and from the hardware message, wherein the first graphical diagram includes;

a first branch having a primary parsing node, wherein the primary parsing node represents a discrete record field within the hardware message and contains information on how to separate the discrete record field from the hardware message;

assemble a second graphical diagram in response to user input, wherein the second graphical diagram includes;

a first state node and a second state node, wherein the first state node is connected with the second state node via a transition, wherein each state node represents a unique hardware state of the hardware device, and the transition includes a transition condition required to move from the first state to the second state, wherein the second graphical diagram maps out various states of the hardware device; and

convert the first and second graphical diagrams into program code from which the connectivity driver is executed.

2. The non-transitory computer readable memory medium of claim 1, wherein the file format is Extensible Markup Language.

3. The non-transitory computer readable memory medium of claim 1, wherein the computer program is a middleware program, a LIS, or a LIMS.

4. The non-transitory computer readable memory medium of claim 1 further comprising program instructions executable by a processor to parse the hardware message and generate the first branch having the primary parsing node when the user inputs a first delimiter.

5. The non-transitory computer readable memory medium of claim 1 further comprising program instructions executable by a processor to simulate operation of the connectivity driver using the second graphical diagram and a virtual hardware device.

6. The non-transitory computer readable memory medium of claim 1, wherein the discrete record field contains a first plurality of discrete data fields within the hardware message.

7. The non-transitory computer readable memory medium of claim 6 further comprising program instructions executable by a processor to further parse the discrete record field and divide the primary parsing node into a plurality of secondary parsing nodes within the first branch when the user inputs a second delimiter, wherein each secondary parsing node represents a discrete data field within the discrete record field and contains information on how to separate each discrete data field from the discrete record field.

8. The non-transitory computer readable memory medium of claim 1, wherein the hardware message is intended to be communicated from a hardware device to the computer program.

9. The non-transitory computer readable memory medium of claim 1 further comprising program instructions executable by a processor to display the first and second graphical diagrams.

10. The non-transitory computer readable memory medium of claim 1, wherein the parsing sequence may also be used for analyzing and converting software data in a file format to a hardware message sent using a hardware protocol readable by a hardware device.

11. A method for graphically developing a connectivity driver, comprising:

inputting a hardware message having a stream of data into a non-transitory computer readable memory medium, wherein the hardware message has a first delimiter for demarking the boundary of a discrete record field within the hardware message;

inputting the first delimiter into the computer readable memory medium;

accessing the computer readable memory medium and generating, using a processor, a first graphical diagram in response to the inputting of the first delimiter, wherein the graphical diagram includes;

a first branch having a primary parsing node, wherein the first branch represents the discrete record field within the hardware message, and wherein the primary parsing node represents the discrete record field within the hardware message and contains information on how to separate the discrete record field from the hardware message;

graphically assembling a second graphical diagram in response to user input, wherein the second graphical diagram includes;

a first state node and a second state node, wherein the first state node is connected with the second state node via a transition, wherein each state node represents a unique hardware state of the hardware device, and the transition includes a transition condition required to move from the first state to the second state, wherein the second graphical diagram maps out various states of the hardware device; and

converting the first and second graphical diagrams into program code from which the connectivity driver is executed.

12. The method of claim 11 further comprising:

inputting a second delimiter into the computer readable memory medium, wherein the hardware message uses the second delimiter for demarking the boundary of a discrete data field within the discrete record field;

accessing the computer readable memory medium and dividing, using the processor, the primary parsing node into a plurality of secondary parsing nodes within the first branch, wherein each secondary parsing node represents a discrete data field within the discrete record field and contains information on how to separate each discrete data field from the discrete record field.

13. The method of claim 11 wherein the first graphical diagram represents a parsing sequence for analyzing and converting a hardware message sent using a hardware protocol into software data having a file format readable by a computer program.

14. The method of claim 13, wherein the file format is Extensible Markup Language.

15. The method of claim 13, wherein the computer program is a middleware program, a LIS, or a LIMS.

16. The method of claim 11 further comprising simulating operation of the connectivity driver using the second graphical diagram and a virtual hardware device.

17. A laboratory information management system including a module for graphically developing a connectivity driver, comprising:

a non-transitory computer readable memory medium; and

at least one processor operable to access from the computer readable memory medium program instructions executable by the processor to;

assemble a first graphical diagram in response to user input, wherein the first graphical diagram represents a parsing sequence for analyzing and converting a hardware message sent using a hardware protocol into software data having a file format readable by a computer program, wherein the entire parsing sequence defines a hardware grammar used to encode and decode discrete fields into and from the hardware message, wherein the first graphical diagram includes;

a first branch having a primary parsing node, wherein the primary parsing node represents a discrete record field within the hardware message and contains information on how to separate the discrete record field from the hardware message; and

assemble a second graphical diagram in response to user input, wherein the second graphical diagram includes;

a first state node and a second state node, wherein the first state node is connected with the second state node via a transition, wherein each state node represents a unique hardware state of the hardware device, and the transition includes a transition condition required to move from the first state to the second state, wherein the second graphical diagram maps out various states of the hardware device.

18. The system of claim 17, wherein the at least one processor is operable to access from the computer readable memory medium program instructions executable by the processor to convert the first and second graphical diagrams into program code from which the connectivity driver is executed.

19. The system of claim 17, wherein the at least one processor is operable to access from the computer readable memory medium program instructions executable by the processor to parse the hardware message and generate the first branch having the primary parsing node when the user inputs a first delimiter.

20. The system of claim 17, wherein the at least one processor is operable to access from the computer readable memory medium program instructions executable by the processor to simulate operation of the connectivity driver using the second graphical diagram and a virtual hardware device.