Last month we presented at PNSE 2014 (International Workshop on Petri Nets and Software Engineering, Tunis, Tunisia, June 23-24, 2014) a paper trying to use evolutionary algorithms to compute some structural components of Petri net models that can be related to liveness problems.
PNSE is a satellite event of Petri Nets 2014 35th International Conference on Application and Theory of Petri Nets and Concurrency and ACSD 2014 14th International Conference on Application of Concurrency to System Design.
Title: Computing Minimal Siphons in Petri Net Models of Resource Allocation Systems: An Evolutionary Approach
Authors: F. Tricas, JM Colom, JJ Merelo
Petri Nets are graph based tools to model and study concurrent systems and their properties; one of them is liveness, which is related to the possibility of every part of the system to be activated eventually. Siphons are sets of places that have been related to liveness properties. When we need to deal with realistic problems its computation is hard or even impossible and this is why in this paper we are approaching it using evolutionary computation, a meta-heuristic that has proved it can successfully find solutions when the search space is big. In this work a formulation of the siphon property using linear constraints is presented for general Petri Nets. We will also present an evaluation for a family of resource allocation systems (RAS). The proposed solution is based on a genetic algorithm (GA); we will show how siphons can be computed using it, with experiments showing that in some cases they are able to find a few solutions in less time than previous deterministic algorithms.
The paper can be downloaded at [PDF] Computing Minimal Siphons in Petri Net Models of Resource Allocation Systems: An Evolutionary Approach.
The presentation used at the conference was:
We feel that this can be the starting point for further work so stay tunned for more research on Petri nets and evolutionary algorithms.