Structural equivalence of expressions containing processes and queries

Abstract

A program that includes expressions written in a process-based language for representing protocol-based applications as processes is disclosed. The process kernel executes a set of equational laws governing structural equivalence of expressions written in the process-based language. A first expression is parsed. The first expression describes that a query is being executed in parallel with a process. The query has a head, which is empty, and a body, which contains a first name being bound to a second name. The first expression is translated as structurally equivalent to a second expression. The second expression describes that the query is executed in parallel with the process if the query is in canonical form. Each occurrence of the first name in the process is replaceable with the second name.

Dependencies are inferred from the claim text.