A transformation graph is a finite directed graph with exactly one edge issuing from each vertex. A graph is subdirectly decomposed into two factor graphs, if it is isomorphic to a subgraph of their direct (Cartesian) product. The decomposition is A-optimal, if the maximal order (i.e., ...
(2002, LNCS, 2280, 281–295) present such a transformation which they independently claim to produce formulas of linear, respectively, quadratic size when measured as the size of the Fischer–Ladner closure of the formula, respectively, the size of its syntax-DAG (directed acyclic graph). We...
Formulas in a when clause may be expressed in conjunctive form, as all filter conditions must be satisfied in order for the rule to be applied. Formulas in a where clause may be expressed in disjunctive form (assuming mutually exclusive conditions), expressing side effects as MT steps that ...
Computing critical pairs in graph transformation, as introduced by Plump [27], is exponential in the size of the preconditions of the rules. For this reason, differentproper subsets of critical pairswith a considerably reduced size were studied that are still complete [1,19,21], clearing the w...
The formula of areacalculation can be taken as the basis of rectangular area formula, and othergraph area formulas can be transformed into rectangular or parallelogram andthen the formula is obtained. The volume calculation formula is based on thevolume calculation formula of cuboid, and the volume...
Transformation theory and Christoffel formulas for matrix biorthogonal polynomials on the real line In this paper transformations for matrix orthogonal polynomials in the real line are studied. The orthogonality is understood in a broad sense, and is give... Álvarez-Fernández, Carlos,G Ariznabarret...
Chapters8and 9 present an iterative formulation of data-flow analysis. Theiterative algorithmworks, in general, on any set of well-formed equations on any graph. Other data-flow algorithms exist; many of these work by deriving a simple model of the control-flow structure of the code being an...
I have a graph of γ ̇vs t for different sets of chosen τ. I didn’t quite fully understand and was hoping if you could give me some advice or tell me if this is the right page to look at. τ1 τ2 τ3 γ ̇l o / * ...
(e.g., as logical formulas in SMT-LIB 2 format [12]) and can hardly reuse the transformation procedures in other mature software verifiers. This slows down the progress pace in the development of verification tools and the growth of the importance of formal methods. The goal of this paper...
Finally, the changes are derived by computing the normalized graph Laplacian of the graph. Sun et al. [23] proposed a method based on image structure consistency, which regarded image structure as an imaging mode-invariant feature and represented the structure between heterogeneous images by ...