XML-based representation of mobile process calculi

• US 6,516,322 B1
• Filed: 04/28/2000
• Issued: 02/04/2003
• Est. Priority Date: 04/28/2000
• Status: Expired due to Term

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Meredith, Lucius Gregory
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US09/560,223
• Time in Patent Office: 1,012 Days
• Field of Search: 707/102
• US Class Current: 1/1
• CPC Class Codes: G06F 16/986 Document structures and storage, e.g. HTML extensions
• CPC Class Codes: G06F 40/123 Storage facilities
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G06F 8/30 Creation or generation of source code
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

A methodology is provided for encoding mobile process calculi in XML. Mobile process calculi (e.g., π-calculus, Join Calculus, Blue Calculus) are often employed in modeling business processes. The present method provides for encoding a mobile process algebra in XML by providing a mobile process algebra, reducing the process algebra to infix notation, transforming the mobile process algebra from infix notation to prefix notation, and then transforming the prefix notation to a set of tags via structural induction. Annotating tags can then be provided around the basic process algebra constructors. The set of tags represent an XML schema. The XML schema can then be reduced to a programming language. An example of reducing a specific algebra (combinators—a derivative of π-calculus) to an XML schema is provided. The XML schema is reduced to a programming language ideal for business workflow processes.

Claims

1. A method of producing a schema for a domain of process algebra, comprising the steps of:

transforming a grammar of the process algebra from infix notation to prefix notation; and

transforming the prefix notation to a set of tags, wherein the set of tags represent a schema.

2. The method of claim 1, the schema being an XML schema.

3. The method of claim 1, the prefix notation being transformed to a set of tags via structural induction.

4. The method of claim 1, the process algebra being one of π

-calculus, Join calculus, and Blue calculus.

5. The method of claim 1, further comprising the step of providing annotating tags around basic process calculus constructors.

6. The method of claim 1, the process algebra being combinators.

7. The method of claim 1, the process algebra including a first verb for representing communicating concurrent transactions and a second verb for representing independent concurrent transactions.

8. A method of producing an XML schema for a domain of process algebra, comprising the steps of:

transforming the process algebra from infix notation to prefix notation; and

transforming the prefix notation to a set of tags via structural induction, wherein the set of tags represent a schema.

9. The method of claim 8, the process algebra being one of π

-calculus, Join calculus, and Blue calculus.

10. The method of claim 8, further comprising the step of providing annotating tags around basic process calculus constructors.

11. The method of claim 8, the process algebra being combinators.

12. The method of claim 8, the process algebra including a first verb for representing communicating concurrent transactions and a second verb for representing independent concurrent transactions.

13. An XML schema comprising:

a first element representing a construct for distinguishing between synchronization of autonomous concurrent operations from interdependent concurrent operations; and

a second element representing a construct for interdependent operations.

14. The XML schema of claim 13, further comprising an element for representing a construct for performing actions.

15. The XML schema of claim 14, further comprising an element for representing messaging and an element for representing ports.

16. The XML schema of claim 14, further comprising an element for representing a construct for grouping actions into concurrently executing actions.

17. The XML schema of claim 14, further comprising an element for representing a construct for grouping actions into sequentially executing actions.

18. The XML schema of claim 13, further comprising an element for representing a construct for providing context events.

19. The XML schema of claim 13, further comprising a test element for representing a construct for providing test conditions.

20. The XML schema of claim 13, further comprising an element for representing a construct for providing mapping.

21. The XML schema of claim 13, further comprising an element for representing a construct for providing a call routine.

22. The XML schema of claim 13, further comprising an element for representing a construct for providing branches in control flow.

23. The XML schema of claim 13, further comprising an element for representing a construct for providing copies of new instances of processes.

24. A software module comprising;

a receiving component adapted to receive a grammar of a process algebra;

a construct component adapted to provide a construct for each operator in the grammar of the process algebra; and

an output component adapted to output the constructs corresponding to the process algebra operators.

25. A system for providing a schema from a process algebra comprising;

means for inputting a process algebra;

means for providing a plurality of constructs corresponding to operators in the process algebra; and

means for outputting the plurality of constructs.

26. A system for producing a schema for a domain of process algebra comprising:

a subsystem for transforming the process algebra from infix notation to prefix notation; and

a subsystem for transforming the prefix notation to a set of tags, wherein the set of tags represent a schema.

27. The system of claim 26, further comprising a subsystem for providing annotating tags around basic process calculus constructors.

28. The system of claim 26, the process algebra including a first verb for representing communicating concurrent transactions and a second verb for representing independent concurrent transactions.

29. A system for producing a schema for a domain of process algebra comprising:

means for transforming the process algebra from infix notation to prefix notation; and

means for transforming the prefix notation to a set of tags, wherein the set of tags represent a schema.

30. The system of claim 29, further comprising means for providing annotating tags around basic process calculus constructors.

31. The system of claim 29, the process algebra including a first verb for representing communicating concurrent transactions and a second verb for representing independent concurrent transactions.