For two bipartite graphs G and G , a bijection ψ : E(G) → E(G) is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if ψ(M) is a perfect matching in G. We characterize bipartite graphs G and G which are related by a matching preserver and the matching preservers between them.

A complete classification of additive rank–one nonincreasing maps on hermitian matrices over Galois field GF (22) is obtained. This field is special and was not covered in a previous paper. As a consequence, some known applications, like the classification of additive rank–additivity preserving maps, are extended to arbitrary fields. An application concerning the preservers of hermitian varieti...

A model refactoring is a model transformation that preservers some behavioral properties of a model. Equally important, a model refactoring should only affect a previously chosen subset of the source model. In this paper, we discuss how to define and execute model refactorings as rule-based transformations. We also present an experimental tool to execute these transformations.

Recently a new method directly translating linear temporal logic (LTL) formulas to deterministic (generalized) Rabin automata was proposed by Javier Esparza and Jan Kret́ınský [1]. Compared to the existing approaches of constructing a non-deterministic Buechi-automaton in the first step and then applying a determinization procedure (e.g. some variant of Safra’s construction) in a second step, th...