On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A classification and constraint-based framework for configuration
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Reducing multiplicities in class diagrams
Proceedings of the 14th international conference on Model driven engineering languages and systems
| Hi-index | 0.00 |
Reconfiguration and configuration repair are central tasks when designing and maintaining long-lived systems. Specifications evolve over time and modifying existing configurations in the hardware domain is prohibitively expensive. Consequently there is a demand for efficient methods to repair and change existing configurations where the number of components and a given layout of links between them is given. We present an efficient approach using network flow algorithms for finding and optimising links between a topology of components. This provides a natural formalism for modelling reconfiguration tasks and repairing configurations.