Graphically based method for developing connectivity drivers

• US 9,152,391 B2
• Filed: 09/24/2013
• Issued: 10/06/2015
• Est. Priority Date: 12/31/2010
• Status: Active Grant

• Current Assignee: STARLIMS Corporation
• Original Assignee: Abbott Laboratories Incorporated
• Inventors: Rivkin, Slava
• Primary Examiner(s): KENDALL, CHUCK O
• Application Number:
  US14/035,694
• Publication Number:
  US 20140096106A1
• Time in Patent Office: 742 Days
• Field of Search: None
• US Class Current: 1/1
• 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 first graphical diagram includes a first branch having a primary parsing node.

2. The method of claim 1, wherein the program instructions are executable by a processor to convert the first graphical diagram into program code from which the connectivity driver is executed.

3. The method of claim 1, wherein the program instructions are executable by a processor to 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.

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

assemble a 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.

5. The method of claim 4, wherein the program instructions are executable by a processor to convert the graphical diagram into program code from which the connectivity driver is executed.

6. 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;

generating a first graphical diagram in response to the inputting of the hardware message, wherein the graphical diagram includes;

a first branch having an initial parsing node, wherein the initial parsing node represents the entire contents of the hardware message; and

inputting a first delimiter into the computer readable memory medium, wherein upon inputting the first delimiter, the first graphical diagram is modified to have additional parsing nodes within the first graphical diagram, wherein each parsing node represents a discrete record field within the hardware message.

7. The method of claim 6 further comprising converting the first graphical diagrams into program code from which the connectivity driver is executed.

8. The method of claim 6 further comprising 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.