XML-based representation of mobile process calculi
First Claim
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 Assignments
0 Petitions
Accused Products
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.
271 Citations
31 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. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
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.- View Dependent Claims (9, 10, 11, 12)
-
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. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20, 21, 22, 23)
-
-
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. - View Dependent Claims (27, 28)
-
-
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. - View Dependent Claims (30, 31)
-
Specification