Sentence examples for transformations rules from inspiring English sources

In the following we describe some transformations rules between the State machine and the Petri net.

In the second part, we introduce new transformation rules to transform the extended and marked BPEL to an automata model.

Our rule set included the transformations colored green in Fig. 3 (i.e. transformation rules where double bonds are not transformed into cycles and conversely).

The chapter illustrates how to transform an entity-relationship diagram into a standard relational schema, by applying transformation rules to entities, relationships, and generalization hierarchies.

Such rules are called transformation rules.

Transformation rules: The result of uniformly replacing any variable in a theorem by any wff is a theorem (rule of substitution).

It can, moreover, be shown that PM is consistent and strongly complete and that each of its axioms and transformation rules is independent.

Any wff of the form (∀a) ⊃ [α ⊃ (∀a)β] is an axiom, provided that α contains no free occurrence of a. Transformation rules: Modus ponens.

It has been proved that this is the shortest possible single axiom that will give a complete basis for PIC with these transformation rules.

An even more economical complete basis for PIC contains the same transformation rules but the sole axiom[(p ⊃ q) ⊃ r] ⊃ [(r ⊃ p) ⊃ (s ⊃ p)].

The transformation rules of T are uniform substitution, modus ponens, and a rule to the effect that if α is a theorem so is Lα (the rule of necessitation).