In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graphs determined by consistency constraints. Hence, topological operations over generalized maps can be specified using graph transformations. The rules we define, are equipped with syntactic criteria ensuring that graphs obtained by applying the rules to generalized maps are also generalized maps. We have developed a static analyzer of transformation rules that checks the syntactic criteria to ensure the preservation of generalized map consistency constraints. Based on this static analyzer, we have designed a rulebased prototype of a kernel of a topology-based modeler. Since adding a new topological operation can be reduced to write a graph transformation rule, we directly obtain an extensible prototype where handled topological objects have built-in consistency. Moreover, first benchmarks show that our prototyp...