scholarly journals Formal Verification of Object-Oriented Graph Grammars Specifications

2007 ◽  
Vol 175 (4) ◽  
pp. 101-114 ◽  
Author(s):  
Ana Paula Lüdtke Ferreira ◽  
Luciana Foss ◽  
Leila Ribeiro
2012 ◽  
Vol 134 (2) ◽  
Author(s):  
Bergen Helms ◽  
Kristina Shea

Computational design synthesis aims to iteratively and automatically generate solution spaces of standard and novel design alternatives to support the innovation process. New approaches are required to generate alternative solutions at the function and behavior level as well as to ease the computational modeling of design knowledge. This paper introduces the approach of object-oriented graph grammars for the computational synthesis of product models based on a Function–Behavior–Structure (FBS) representation. The approach combines the advantages of a generic and systematic design method with a highly computable graph representation and object-oriented concepts. Through this combination, advances in terms of extendibility, efficiency, and flexible formalization of declarative and procedural engineering knowledge are achieved. Validation of the method is given through the synthesis of hybrid powertrains. The generation of hybrid powertrain solution spaces is shown, especially focusing on the impact of an evolving vocabulary, or building blocks, for synthesis. Future work includes integrating search methods in the synthesis process along with quantitative evaluation using simulation methods.


Author(s):  
Clemens Münzer ◽  
Kristina Shea ◽  
Bergen Helms

Ever since computers have been used to support human designers, a variety of representations have been used to encapsulate engineering knowledge. Computational design synthesis approaches utilize this knowledge to generate design candidates for a specified task. However, new approaches are required to enable systematic solution space exploration. This paper presents an approach that combines a graph-based, object-oriented knowledge representation with first-order logic and Boolean satisfiability. This combination is used as the foundation for a generic, automated approach for requirement-driven computational design synthesis. Available design building blocks and a design task defined through a set of requirements are modeled in a graph-based environment and then automatically transferred into a Boolean satisfiability problem and solved, considering a given solution size. The solution is then automatically transferred back to the graph-based domain. The method is validated through the synthesis of automotive powertrains. The contribution of the paper is a new method that is both able to determine that an engineering task is solvable or not given a set of design building blocks and able to systematically explore the solution space.


Sign in / Sign up

Export Citation Format

Share Document