Abstract: A method for executing a schedule in a workflow application is provided. The method includes selectively storing a schedule state to a storage medium based on a latency attribute associated with the schedule. Also provided is a method of executing a workflow application comprising long running transactions. This method includes selectively storing a schedule state to a storage medium based on a latency attribute associated with the schedule, and selectively compensating certain actions within the schedule according to a compensation parameter associated with an action, based on failure or abortion of another action within the schedule. In addition, there is provided a method of executing a schedule comprising selectively compensating certain actions or transactions within the schedule according to a compensation parameter associated with an action or transaction, based on failure or abortion of another action or transaction within the schedule.

Abstract: A methodology of reducing process algebra to a language that facilitates modeling a business workflow process is provided. A process algebra is reduced to a model for business workflow processes. The model is then reduced to a scheduling programming language to allow users to create models of business process by selecting between features of the model and conventional modeling features. The scheduling programming language can be represented as a graphical user interface program that is convertible to a schedule language written in a programmable language. The present invention provides for explicitly representing parallelism within the business workflow process by separating interdependent transactions from independent transactions. The isolation of certain transactions are relaxed, such that users can define transactional boundaries in order to increase granularity of the transaction at an action level and provide visibility of transactions at intermediate steps.

Abstract: An error-handling framework is provided for business process transactions. The error-handling framework facilitates coordination of the invocation of exception and compensation handlers in response to errors. The error-handling framework includes support for custom ordering of compensation actions, data flow into and out of compensation actions, and management of the process state visible to compensation actions.

Abstract: The present invention provides systems and methods that facilitate simulating quantum computing and/or provide a language to program a quantum computer. The systems and methods translate received computer instructions (e.g., quantum computer based instructions) to a process algebra (e.g., rho and pi calculus) representation that can be executed by a classical computer to produce a result indicative of a quantum computer. Such mapping can include transformations between vectors, scalars, dual vector and operators in Hilbert space to processes, named processes (quoted names) and quote maps in rho calculus space. Thus, the systems and methods of the present invention can transform a classical computer into a quantum computer simulator. In addition, this process algebra representation can be executed on a quantum computer; thus, the representation can additionally be utilized as a computer language to program a quantum computer.

Abstract: Trees are a common semantic denominator of XML data types and process calculi. This indicates a potential tight intertwining of the syntax and semantics of data and processes. The invention provides this intertwining via a process calculus wherein the data language syntax is a fragment of the programming language syntax.

Abstract: The systems and methods of the present invention utilize stochastic calculus (e.g., pi calculus) to determine (e.g., specify, predict, etc.) quality of service that includes at least one of rate, uptime and capacity. The quality of service can be indicative of a level of service provided and/or required by an agent (e.g., a web service). The quality of service can be obtained by representing an agent's contract via a model (e.g., state diagram or mathematical algorithm) and decorating the model with cost functions that are utilized to compute transition costs that are employed to predict associated rates for respective transitions. The model can further be decorated with error states to determine uptime and employed to determine channel capacity. In general, the quality service of a requesting agent and a providing agent can be compared to determine whether the providing agent can satisfy the level of performance of the requesting agent.