Graph grammar based Petri nets model of concurrency for self-adaptive hp-finite element method with rectangular elements

  • Authors:
  • Arkadiusz Szymczak;Maciej Paszyński

  • Affiliations:
  • Department of Computer Science, AGH University of Science and Technology, Cracow, Poland;Department of Computer Science, AGH University of Science and Technology, Cracow, Poland

  • Venue:
  • PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper presents the Petri nets model describing the process of rectangular finite element mesh generation and h adaptation. This is the first step towards the formal analysis of all the parts of the existing graph grammar based parallel adaptive hp-Finite Element Method algorithms expressed by graph grammar productions. The mesh transformations are expressed as composite programmable graph grammar productions. The transitions on Petri nets correspond to the execution of graph grammar productions. The graph grammar based algorithms modeled as a Petri net can be analyzed for deadlocks, starvation or infinite execution. The parallel adaptive algorithms have many applications in the area of numerical simulations of different engineering problems, including material science, heat transfer, wave propagation and other.