Evolving Petri nets with a genetic algorithm

Authors:
Holger Mauch
Affiliations:
University of Hawaii at Manoa, Dept. of Information and Computer Science, Honolulu, HI
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 2
Cited 4

Petri nets: an introduction

Petri nets: an introduction
Machine Learning

Machine Learning

Evolving petri nets to represent metabolic pathways

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Genetic process mining: an experimental evaluation

Data Mining and Knowledge Discovery
Modelling epistasis in genetic disease using Petri nets, evolutionary computation and frequent itemset mining

Expert Systems with Applications: An International Journal
Genetic process mining

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets

Quantified Score

Hi-index	0.01

Visualization

Abstract

In evolutionary computation many different representations ("genomes") have been suggested as the underlying data structures, upon which the genetic operators act. Among the most prominent examples are the evolution of binary strings, real-valued vectors, permutations, finite automata, and parse trees. In this paper the use of place-transition nets, a low-level Petri net (PN) class [1,2], as the structures that undergo evolution is examined. We call this approach "Petri Net Evolution" (PNE). Structurally, Petri nets can be considered as specialized bipartite graphs. In their extended version (adding inhibitor arcs) PNs are as powerful as Turing machines. PNE is therefore a form of Genetic Programming (GP). Preliminary results obtained by evolving variablesize place-transition nets show the success of this approach when applied to the problem areas of boolean function learning and classification.