Abstract
Abstract Graph transformation systems are a well known formal specification technique that support the rule based specification of the dynamic behaviour of systems. Recently, many specification languages for graph transformation systems have been developed, and modularization techniques are then needed in order to deal with large and complex graph transformation specifications, to enhance the reuse of specifications, and to hide implementation details. In this paper we present an abstract categorical approach to modularization of graph transformation systems. Modules are called cat –modules and defined over a generic category cat of graph transformation specifications and morphisms. We describe the main characteristics and properties of cat –modules, their interconnection operations, namely union, composition and refinement of modules, and some compatibility properties between such operations.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
