Transactional Model of Graph Transformations in Computer Aided Design

Leszek Kotulski; Barbara Strug

doi:10.4028/www.scientific.net/KEM.572.315

Paper Titles

The Mechanism of Electrochemical Discharge (ECD)
p.295

Rule Extraction from Support Vector Machine and its Application to Hot-Dip Galvanizing
p.300

Accelerated Production of White Pepper Using Integrated Mechanical and Enzymatic Solutions in an Automated Machine
p.304

Innovative Approach for Teaching Graphical Engineering Focused on CAD/CAM/CAE Systems
p.311

Transactional Model of Graph Transformations in Computer Aided Design
p.315

Numerical Study on Mechanical Characteristics of Steam Turbine Valve Disc
p.319

Numerical Analysis of Feed Rate Influence on Hollow Hub Shape during Rolling Extrusion Process
p.323

Study on the Model of the Torch Tracks of CNC Flame Cutting of Rectangular Steel Pipes
p.327

Manufacturability of Sheet Metal Design with the Help of Product Data Management (PDM)
p.331

HomeKey Engineering MaterialsKey Engineering Materials Vol. 572Transactional Model of Graph Transformations in...

Transactional Model of Graph Transformations in Computer Aided Design

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Key Engineering Materials (Volume 572)

Pages:

315-318

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.572.315

Citation:

Cite this paper

Online since:

September 2013

Authors:

Leszek Kotulski, Barbara Strug

Keywords:

Design Modification, Design Transformation, Hypergraph Representation, Hypergraph Transformation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Rozenberg, G. Handbook of Graph Grammars and Computing By Graph Transformation: Vol. 1, Foundations: World Scientific Publishing Co., 1997, ISBN 9810228848.

DOI: 10.1142/9789812384720_0001

Google Scholar

[2] l] A. Habel, H. J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement. LNCS 247, pp.207-219, Springer-Verlag, (1987).

DOI: 10.1007/bfb0039608

Google Scholar

[3] L. Kotulski, B. Strug, Multi-agent system for distributed adaptive design. Key Engineering Materials, 486: 217–220, (2011).

DOI: 10.4028/www.scientific.net/kem.486.217

Google Scholar

[4] L. Kotulski, B. Strug. Supporting communication and cooperation in distributed representation for adaptive design. Advanced Engineering Informatics, 27 (2013), pp.220-229. doi: 10. 1016/j. aei. 2012. 10. 00.

DOI: 10.1016/j.aei.2012.10.002

Google Scholar

[5] L. Kotulski, B. Strug,.: Distributed Adaptive Design with Hierarchical Autonomous Graph Transformation Systems, (ICCS 2007, Beijing), LNCS 4488, pp.880-887, (2007).

DOI: 10.1007/978-3-540-72586-2_123

Google Scholar