会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Binding for business workflow processes
    • 绑定业务工作流程
    • US07467371B1
    • 2008-12-16
    • US09560371
    • 2000-04-28
    • Lucius Gregory MeredithMarc LevyBrian BeckmanAnthony AndrewsBimal MehtaMitra Kanchan
    • Lucius Gregory MeredithMarc LevyBrian BeckmanAnthony AndrewsBimal MehtaMitra Kanchan
    • G06F9/44
    • G06F8/10
    • A methodology of employing a binding for interfacing a business workflow process executable program to a real world implementation. The binding can be reduced to a programming language. A preferable programming language is XML (Extensible Markup Language). Separation of the business workflow processes and the binding allow for the same business workflow process to be implemented across a variety of different technologies. The binding maps ports and messages to corresponding units of codes and invocations of a particular technology being utilized for the modeling of the business workflow process. The binding provides a user with the ability to structure schedule messages, define the relationship of schedule ports to units of code, define the relationship of schedule actions to invocations, control the flow of data between messages, provide details of schedule conditionals and specify the interaction of the schedule with specific technology behaviors.
    • 一种使用绑定来将业务工作流程可执行程序连接到现实世界实现的方法。 绑定可以减少到一种编程语言。 优选的编程语言是XML(可扩展标记语言)。 分离业务流程流程和绑定允许在各种不同的技术上实现相同的业务流程流程。 绑定将端口和消息映射到相应的代码单元和用于业务工作流过程建模的特定技术的调用。 绑定为用户提供了构建调度消息的能力,定义调度端口与代码单元的关系,定义调度操作与调用的关系,控制消息之间的数据流,提供调度条件的详细信息并指定交互 的具体技术行为。
    • 3. 发明授权
    • Efficient processing of a convoy workflow scenario in a message driven process
    • 在消息驱动过程中高效地处理车队工作流场景
    • US07370333B2
    • 2008-05-06
    • US10452961
    • 2003-06-02
    • Bimal MehtaJohannes KleinLee GraberPaul MaybeeSriram BalasubramanianSanjib SahaSatish R. ThattePaul F. Ringseth
    • Bimal MehtaJohannes KleinLee GraberPaul MaybeeSriram BalasubramanianSanjib SahaSatish R. ThattePaul F. Ringseth
    • G06F9/44
    • G06F9/54G06F2209/542
    • An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure. The runtime infrastructure is tightly integrated with the underlying correlation and subscription evaluation framework.
    • XLANG / s编译器在编译期间检测车队场景,并生成运行时指令,将传入的消息与业务流程实例正确关联。 存在于事件驱动过程中的车队场景由在提供给后续接收操作的接收操作期间初始化的相关集定义。 编译器通过分析XLANG / s程序的控制和数据流来检测这些车队场景。 三个车队模式有区别:(1)活动车队,(2)统一的顺序车队,(3)不均匀的顺序车队。 XLANG / s允许对车队场景的声明性描述,而不需要了解支持其正确执行的低级细节。 通过静态分析书面工作流应用程序来演绎应用程序使用的车队场景的性质和类型来处理方便情景。 在编译时提取信息以支持运行时基础设施。 运行时基础架构与底层的相关和订阅评估框架紧密集成。
    • 4. 发明申请
    • Data flow analysis of transactional processes
    • 事务过程的数据流分析
    • US20050050527A1
    • 2005-03-03
    • US10648461
    • 2003-08-26
    • Donald McCradyPaul RingsethBimal Mehta
    • Donald McCradyPaul RingsethBimal Mehta
    • G06F9/45
    • G06F8/433
    • A XLANG/s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.
    • 提供了一种XLANG / s编译方法,该方法使用程序流程图的数据流分析来确定数据对象的生命周期。 根据抽象的计算机指令创建流程图。 将深度优先顺序分配给基本块,并且确定基本块之间的优势关系。 确定流程图中是否存在任何循环,如果是,则确定循环。 确定数据对象的创建点,销毁点和锁定点。 将指令插入到计算机代码中,以在创建点创建至少一个数据对象,以在销毁点销毁数据对象,并将数据对象锁定在锁定点。
    • 7. 发明授权
    • Data flow analysis of transactional processes
    • 事务过程的数据流分析
    • US07210135B2
    • 2007-04-24
    • US10648461
    • 2003-08-26
    • Donald James McCradyPaul F. RingsethBimal Mehta
    • Donald James McCradyPaul F. RingsethBimal Mehta
    • G06F9/45
    • G06F8/433
    • A XLANG/s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.
    • 提供了一种XLANG / s编译方法,它使用程序流程图的数据流分析来确定数据对象的生命周期。 根据抽象的计算机指令创建流程图。 将深度优先顺序分配给基本块,并且确定基本块之间的优势关系。 确定流程图中是否存在任何循环,如果是,则确定循环。 确定数据对象的创建点,销毁点和锁定点。 将指令插入到计算机代码中,以在创建点创建至少一个数据对象,以在销毁点销毁数据对象,并将数据对象锁定在锁定点。
    • 9. 发明授权
    • Method and system for hierarchical transactions and compensation
    • 分层交易和补偿的方法和系统
    • US06625602B1
    • 2003-09-23
    • US09560225
    • 2000-04-28
    • Lucius Gregory MeredithAmit MitalMarc LevyBrian BeckmanAnthony AndrewsBimal Mehta
    • Lucius Gregory MeredithAmit MitalMarc LevyBrian BeckmanAnthony AndrewsBimal Mehta
    • G06F700
    • G06Q10/10G06Q30/06Y10S707/99938Y10S707/99939Y10S707/99953
    • A method for executing a schedule in a workflow application is provided. The method comprises a hierarchical transaction commit rule allowing access to the data associated with an action in the schedule according to a transaction boundary and the state of the action. The invention further comprises selectively compensating at least one action according to a compensation parameter and at least one transaction boundary after abortion of another action. The invention further provides storing schedule state information to a storage medium based on a transaction boundary within the schedule. In addition, the invention provides for selectively obtaining at least a portion of the schedule state information from the storage medium, and selectively monitoring the schedule execution based on at least a portion of the schedule information obtained from the storage medium. Further provided, is a computer-readable medium having computer-executable instructions for performing the steps of the above methods.
    • 提供了一种用于在工作流应用程序中执行日程表的方法。 该方法包括分层交易提交规则,允许根据事务边界和动作状态访问与调度中的动作相关联的数据。 本发明还包括根据补偿参数和在堕胎另外的动作之后的至少一个交易边界选择性地补偿至少一个动作。 本发明还提供了一种基于表内的事务边界向存储介质存储日程状态信息。 此外,本发明提供从存储介质中选择性地获得调度状态信息的至少一部分,并且基于从存储介质获得的调度信息的至少一部分来选择性地监视调度执行。 进一步提供的是具有用于执行上述方法的步骤的计算机可执行指令的计算机可读介质。
    • 10. 发明授权
    • Efficient processing of a convoy workflow scenario in a message driven process
    • 在消息驱动过程中高效地处理车队工作流场景
    • US08606843B2
    • 2013-12-10
    • US12054569
    • 2008-03-25
    • Bimal MehtaJohannes KleinLee GraberPaul MaybeeSriram BalasubramanianSanjib SahaSatish R. ThattePaul F. Ringseth
    • Bimal MehtaJohannes KleinLee GraberPaul MaybeeSriram BalasubramanianSanjib SahaSatish R. ThattePaul F. Ringseth
    • G06F15/16G06F3/00
    • G06F9/54G06F2209/542
    • An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure. The runtime infrastructure is tightly integrated with the underlying correlation and subscription evaluation framework.
    • XLANG / s编译器在编译期间检测车队场景,并生成运行时指令,将传入的消息与业务流程实例正确关联。 存在于事件驱动过程中的车队场景由在提供给后续接收操作的接收操作期间初始化的相关集定义。 编译器通过分析XLANG / s程序的控制和数据流来检测这些车队场景。 三个车队模式有区别:(1)活动车队,(2)统一的顺序车队,(3)不均匀的顺序车队。 XLANG / s允许对车队场景的声明性描述,而不需要了解支持其正确执行的低级细节。 通过静态分析书面工作流应用程序来演绎应用程序使用的车队场景的性质和类型来处理方便情景。 在编译时提取信息以支持运行时基础设施。 运行时基础架构与底层的相关和订阅评估框架紧密集成。