We describe a concrete construction of all pushout complements for two given morphisms f : A → B, m : B → D in the category of hypergraphs, valid also for the case where f, m are non-injective. To our knowledge such a construction has not been discussed before in the literature. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show...

We present a general approach for representing and combining alignments and computing these combinations, based on the category theoretic notions of diagram, pushout, and colimit. This generalises the possible ‘shapes’ of alignments that have been introduced previously in similar approaches. We use the theory of institutions to represent heterogeneous ontologies, and show how the tool Hets can ...

Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a double-pushout (DPO) diagram in the category of graphs. We show how intuitionistic linear logic can be extended with resource-bound quantification, allowing for an im...

We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem via a backward analysis. As the well-quasi order required for a well-structured transition system we use the graph minor ordering. We give an explicit construction of the backward step and apply our theory in order to ...

We present a general approach for representing, composing, and computing alignments, based on the category theoretic notions of diagram, pushout, and colimit. This generalises the possible ‘shapes’ of alignments that have been introduced previously in similar approaches. We use the theory of institutions to represent heterogeneous ontologies, and show how the tool Hets can be employed to comput...

In this paper, we consider the problem of selecting a set of aggressor nets that maximize crosstalk induced noise or delay pushout on a coupled victim net, under given constraints. We formulate the problem mathematically and propose efficient Lagrangian Relaxation and network flow based approaches that guarantee an optimal solution. We also formulate and solve this problem while considering the...

We describe a concrete construction of all pushout complements for two given morphisms f : A → B, m : B → D in the category of hypergraphs, valid also for the case where f, m are non-injective. To our knowledge such a construction has not been discussed before in the literature. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show...

We define a construction operation on hypergraphs using a colimit and show that its expressiveness concerning graph rewriting is equal to the graph expressions of Courcelle and the double-pushout approach of Ehrig. With an inductive way of representing graphs, graph rewriting arises naturally as a derived concept. The usefulness of our approach for the compositional modelling of concurrent syst...

Invertible transformations can be used for realizing a system where development is done in different views, keeping the views consistent with a common model. A method to realize such a system is called automatic Model-View-Controller engineering (MVARE). In this thesis important properties of general MVARE are identified and discussed. The invertibility of a number of rewriting techniques is di...

In this paper, we review the current dress code violations that have made national news. These issues spotlighted racist and sexist embedded within common K-12 codes. We also analyze all school codes one county in a mid-western state to examine various issues. end paper with an assessment for readers determine levels of racism sexism their own district