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.
Difference between revisions of "VIATRA2/Benchmarks/Petri-net Simulation Benchmark"
(New page: == The Petri net simulation benchmark == === Benchmark description === The Petri-net benchmark suite captures the simulation problem of visual languages with dynamic operational semantic...) |
(→The Petri net simulation benchmark) |
||
| Line 3: | Line 3: | ||
=== Benchmark description === | === Benchmark description === | ||
| − | The Petri-net benchmark suite | + | The Petri-net benchmark suite is defined to capture the problem of |
| − | visual | + | visual language simulation with dynamic operational semantics. |
| − | This | + | This suite summarizes typical domain specific language simulation with the following characteristics: (i) mostly static |
graph structure, (ii) relatively small and local model manipulations, and (iii) typical | graph structure, (ii) relatively small and local model manipulations, and (iii) typical | ||
as-long-as-possible (ALAP) execution mode. This benchmark focuses on the effective | as-long-as-possible (ALAP) execution mode. This benchmark focuses on the effective | ||
| Line 14: | Line 14: | ||
based approaches will have to restart the matching from scratch after the net changed. | based approaches will have to restart the matching from scratch after the net changed. | ||
| − | For a detailed test specification, see the following article: | + | For a more detailed test specification, see the following article: |
Bergmann G.,Horváth Á., Ráth I., Varró D.: A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation. | Bergmann G.,Horváth Á., Ráth I., Varró D.: A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation. | ||
In: Proc. of the 4th International Conference on Graph Transformation (ICGT'08), Leicester, | In: Proc. of the 4th International Conference on Graph Transformation (ICGT'08), Leicester, | ||
| Line 20: | Line 20: | ||
=== Metamodeling === | === Metamodeling === | ||
| + | |||
| + | The Petri-net metamodel used in this benchmark is depicted in Fig. 1. In order to have a comparable suite we tried to define the metamodel as simple as possible and therefor used only entities and relations. | ||
| + | |||
| + | [[Image:petrimeta.png|frame|The Petri-net metamodel]] | ||
=== Initial model === | === Initial model === | ||
Revision as of 08:26, 12 June 2008
Contents
The Petri net simulation benchmark
Benchmark description
The Petri-net benchmark suite is defined to capture the problem of visual language simulation with dynamic operational semantics.
This suite summarizes typical domain specific language simulation with the following characteristics: (i) mostly static graph structure, (ii) relatively small and local model manipulations, and (iii) typical as-long-as-possible (ALAP) execution mode. This benchmark focuses on the effective reusability of already matched elements as typical firing of a transition only involves a small part of the net. While an incremental pattern matcher can track the changes of the Petri net and updates only the involved sub-matchings, non-incremental local search based approaches will have to restart the matching from scratch after the net changed.
For a more detailed test specification, see the following article:
Bergmann G.,Horváth Á., Ráth I., Varró D.: A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation. In: Proc. of the 4th International Conference on Graph Transformation (ICGT'08), Leicester, UK, September 2008
Metamodeling
The Petri-net metamodel used in this benchmark is depicted in Fig. 1. In order to have a comparable suite we tried to define the metamodel as simple as possible and therefor used only entities and relations.
