TY  - JOUR
T1  - Using Metaheuristics and SPC in the Analysis of State Spaces of Petri Nets
AU - Jimenez Serrano, Eleazar 
JO  - Journal of Engineering and Applied Sciences
VL  - 5
IS  - 6
SP  - 413
EP  - 419
PY  - 2010
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2010.413.419
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2010.413.419
KW  - impracticability
KW  -stochastic optimization
KW  -reachability
KW  -state space
KW  -Petri nets
KW  -limitation
AB  - Reachability problems of state spaces derived from Petri nets are mainly tackled through structure analysis of the network and state space analysis of the behavior of the network. Both types of analysis have been combined in order to cope with their limitations but still the state space explosion in big networks keeps the margin of impracticability large. Here we use simulation, the third type of analysis technique and present four partial exploration metaheuristic methods intended to explore only certain evolutions of the state space and find the searched state in the fastest possible way (pathwise). The methods adopt some fundaments from statistical process control and six sigma used in the manufacturing industry and the example presented is precisely for a manufacturing system.
ER  -