A Programmed Graph Rewriting System for Software Process Management

Earlier research on product family design~PFD! often highlights isolated and successful empirical studies with a limited attempt to explore the modeling and design support issues surrounding this economically important class of engineering design problems. This paper proposes a graph rewriting system to organize product family data according to the underpinning logic and to model product derivation mechanisms for PFD. It represents the structural and behavioral aspects of product families as family graphs and related graph operations, respectively. The derivation of product variants becomes a graph rewriting process, in which family graphs are transformed to variant graphs by applying appropriate graph rewriting rules. The system is developed in the language of programmed graph rewriting systems or PROGRES, which supports the specification of hierarchical graph schema and parametric rewriting rules. A meta model is defined for family graphs to factor out those entities common to all product families. A generic model is defined to describe all specific entities relevant to particular families. An instance model describes all product variants for individual customer orders. A prototype of a graph-based PFD system for office chairs is also developed. The system can provide an interactive environment for customers to make choices among product offerings. It also facilitates design automation of product families and enhances interactions and negotiations among sales, design, and manufacturing.

show abstract

“…7 in Heimann et al, 1995!. The meta model and graph transformations are defined by the classes and productions in the PROGRES language.…”

Section: Graph Rewriting Systems For Pfdmentioning

confidence: 99%

Product family modeling and design support: An approach based on graph rewriting systems

Du¹,

Jiao

Tseng

2002

AIEDAM

View full text Add to dashboard Cite

show abstract

Formal business process engineering based on graph grammars

Klauck

MüLLER

1997

International Journal of Production Economics

View full text Add to dashboard Cite

DYNAMITE: DYNAMIc Task nEts for software process management

Heimann¹,

Joeris²,

Krapp³

et al.

Proceedings of IEEE 18th International Conference on Software Engineering

View full text Add to dashboard Cite

Managing the software development and maintenance process has been identified as a great challenge for several years. Software processes are highly dynamic and can only rarely be planned completely in advance. Dynamic task nets take this into account. They are built and modified incrementally as a software process is executed. Dynamic task nets have been designed t o solve important problems of process dynamics, including product-dependent structural evolution, feedbacks, and concurrent engineering. In order to describe editing and enactment (and their interaction) in a uniform way, task nets are formally defined by means of a programmed graph rewriting system.

show abstract

A Programmed Graph Rewriting System for Software Process Management

Cited by 4 publications

References 6 publications

Product family modeling and design support: An approach based on graph rewriting systems

Product family modeling and design support: An approach based on graph rewriting systems

Formal business process engineering based on graph grammars

DYNAMITE: DYNAMIc Task nEts for software process management

Contact Info

Product

Resources

About