The traditional double-pushout approach to graph transformation does not allow to change node labels in an arbitrary context. We propose a simple solution to this problem, namely to use rules with partially labelled interface graphs and to match rules injectively. In [8] we have shown that injective matching makes the double-pushout approach more expressive, and here we further generalise that ...

This numerical study was conducted to simulate and analyze the pushout test for new shear connector in a steel-concrete composite system. In this system, stirrups of reinforced concrete beam are used as connectors when passed through holes drilled web inverted steel T-section. The analysis performed by creating three-dimensional finite element model using program ANSYS 21 student version behavi...

We call a finitely complete category diexact if every difunctional relation admits a pushout which is stable under pullback and itself a pullback. We prove three results relating to diexact categories: firstly, that a category is a pretopos if and only if it is diexact with a strict initial object; secondly, that a category is diexact if and only if it is Barr-exact, and every pair of monomorph...

We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open systems which might interact with the surrounding environment and endowed with a colimit-based composition operation. We show that natural notions of bisimilarity...

In this paper, using a relation between Schur multipliers of pairs and triples of groups, the fundamental group and homology groups of a homotopy pushout of Eilenberg-MacLane spaces, we present among other things some behaviors of Schur multipliers of pairs and triples with respect to free, amalgamated free, and direct products and also direct limits of groups with topological approach.

Sesqui-pushout (SqPO) rewriting along non-linear rules and for monic matches is well-known to permit the modeling of fusing cloning vertices edges, yet date, no construction a suitable concurrency theorem was available. The lack such theorem, in turn, rendered compositional reasoning systems largely infeasible. We develop this paper SqPO-rewriting categories that are quasi-topoi (subsuming exam...

In several familiar subcategories of the category Top of topological spaces and continuous maps, embeddings are not pushoutstable. But, an interesting feature, capturable in many categories, namely in categories B of topological spaces, is the following: ForM the class of all embeddings, the subclass of all pushout-stable M-morphisms (that is, of those M-morphisms whose pushout along an arbitra...