Skip to main content

Notice: this Wiki will be going read only early in 2024 and edits will no longer be possible. Please see: https://gitlab.eclipse.org/eclipsefdn/helpdesk/-/wikis/Wiki-shutdown-plan for the plan.

Jump to: navigation, search

Difference between revisions of "VIATRA/DSE"

(Important links)
(Better intro)
Line 1: Line 1:
= VIATRA-DSE Wiki Documentation =
+
= VIATRA Design Space Exploration Framework (VIATRA-DSE) =
  
Design space exploration (DSE) is a multi-criteria, search-based design process, which searches for good enough solutions within the possible design alternatives. VIATRA-DSE defines design candidates as EMF models, goals and constraints as [[EMFIncQuery|EMF-IncQuery]] patterns and alters the model via domain specific transformation rules.
+
Design space exploration (DSE) is a multi-criteria, search-based design process, which searches for good enough solutions within the possible design alternatives.
  
== Main features ==
+
VIATRA-DSE is Java based framework for model-driven, rule-based design space exploration with the following main concepts:
 +
* '''Model-driven:''' the problem representation is a typed attributed graph, which well fits in the processes of model-driven approaches, where models are typically graph-like structures and constraints are graph patterns. VIATRA-DSE stores the models (design candidates) as [https://www.eclipse.org/modeling/emf/ EMF] models and captures constraints as [[EMFIncQuery|IncQuery]] graph patterns.
 +
* '''Rule-based:''' in certain scenarios we not only interested in a solution (e.g. sudoku), but we also need to know how to reach that solution (e.g. Rubik's cube). In VIATRA-DSE rules are defined as graph-transformation rules, while solutions are defined as a sequence of rules applications (trajectory) which transforms the initial model into a desired one.
 +
* '''Multi-Objective Optimization:''' VIATRA-DSE is able to handle multiple objective functions, both hard objectives (shall be satisfied by a goal state) and soft objectives (should be optimized), which can be derived from the model (graph pattern, simulation, etc.) or from the trajectory.
 +
* '''Meta-heuristic strategies:''' meta-heuristic search techniques are widely used in optimization problems. VIATRA-DSE comes with a set of built-in exploration strategies such as depth and breadth first search, fixed-priority strategy, hill climbing strategy, genetic algorithm and more will come. Developers can easily integrate their new strategies.
  
* Based on EMF and EMF-IncQuery
 
* Supports parallel algorithms
 
* There are already a number of implemented algorithms:
 
** Depth first search
 
** Breadth first search
 
** Fixed priority search
 
** Hill climbing strategy
 
** Non-dominated Sorting Genetic Algorithm (NSGA-II)
 
* Easy to use API
 
* Parts of the framework can be changed via interfaces
 
  
 
== User's guide ==
 
== User's guide ==

Revision as of 17:17, 26 March 2015

VIATRA Design Space Exploration Framework (VIATRA-DSE)

Design space exploration (DSE) is a multi-criteria, search-based design process, which searches for good enough solutions within the possible design alternatives.

VIATRA-DSE is Java based framework for model-driven, rule-based design space exploration with the following main concepts:

  • Model-driven: the problem representation is a typed attributed graph, which well fits in the processes of model-driven approaches, where models are typically graph-like structures and constraints are graph patterns. VIATRA-DSE stores the models (design candidates) as EMF models and captures constraints as IncQuery graph patterns.
  • Rule-based: in certain scenarios we not only interested in a solution (e.g. sudoku), but we also need to know how to reach that solution (e.g. Rubik's cube). In VIATRA-DSE rules are defined as graph-transformation rules, while solutions are defined as a sequence of rules applications (trajectory) which transforms the initial model into a desired one.
  • Multi-Objective Optimization: VIATRA-DSE is able to handle multiple objective functions, both hard objectives (shall be satisfied by a goal state) and soft objectives (should be optimized), which can be derived from the model (graph pattern, simulation, etc.) or from the trajectory.
  • Meta-heuristic strategies: meta-heuristic search techniques are widely used in optimization problems. VIATRA-DSE comes with a set of built-in exploration strategies such as depth and breadth first search, fixed-priority strategy, hill climbing strategy, genetic algorithm and more will come. Developers can easily integrate their new strategies.


User's guide

Contributors guide

Releases

There are no releases yet. We plan to make our first release (0.7) at the end of June 2015.

Important links

Copyright © Eclipse Foundation, Inc. All Rights Reserved.