Different types of graphs have successfully been used to represent different objects in design problems. Graph transformations are often used as a way to generate, update and modify such graphs. Typical use of graph productions assumes that change of a graph is done by applying a single transformation or a sequence of independent productions. Yet, in many real life design tasks the application of a production may depend on the possibility of applying other productions. Moreover the productions required to be applied usually only depend on the current graph so the set of productions cannot be defined apriori. In this paper we present a novel approach, called a transactional model, where a set of productions is dynamically chosen in a way that it is possible to fulfill a common goal.. Only if all of the productions can be applied the whole transaction is carried out. The approach is illustrated with the problem from the domain of architectural design.