Graph Grammar Based Petri Net Controlled Direct Solver Algorithm
In this paper we present the Petri net setting the optimal order of elimination for directsolver working with hp refined finite finite element meshes. The computational mesh is representedby a graph, with graph vertices corresponding to finite element nodes. The directsolver algorithm is expressed a...
Main Authors: | Arkadiusz Szymczak, Maciej Paszyński, David Pardo |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH University of Science and Technology Press
2010-01-01
|
Series: | Computer Science |
Subjects: | |
Online Access: | http://journals.agh.edu.pl/csci/article/download/122/71 |
Similar Items
-
Remarks on the Reachability Graphs of Petri Nets
by: Yuriy Anatol’yevich Belov
Published: (2022-12-01) -
Structural matrices for Signed Petri net
by: Payal, et al.
Published: (2022-05-01) -
Existence of Forbidden Digraphs for Crisp Boolean Petri Nets
by: Gajendra Pratap Singh, et al.
Published: (2020-02-01) -
CPN Tools-Assisted Simulation and Verification of Nested Petri Nets
by: L. W. Dworza´nski, et al.
Published: (2015-03-01) -
Discrete, continuous, and hybrid Petri Nets /
by: David, Rene, 1939-, et al.
Published: (2005)