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 variable-size place-transition nets show the success of this approach when applied to the problem areas of boolean function learning and classification.
This research was supported in part by DARPA grant NBCH1020004.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Reisig, W.: Petri Nets: an Introduction. Springer-Verlag, Berlin, Germany (1985)
Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77 (1989) 541–580
Mitchell, T.M.: Machine Learning. WCB/McGraw-Hill, Boston, MA (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mauch, H. (2003). Evolving Petri Nets with a Genetic Algorithm. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_76
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive