A GA approach to solving reachability problems for Petri nets

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 11, 1996, Pages 1774-1779

  Takahashi, Keiko ^a   Yamamura, Masayuki ^a   Kobayashi, Shigenobu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Cost performance; Genetic algorithms; Petri nets; Reachability problems; State space explosion problems

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; VECTORS;

DINING PHILOSOPHERS PROBLEMS; NONNEGATIVE PARIEKH VECTOR; REACHABILITY PROBLEMS;

PETRI NETS;

EID: 0030289091     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. E.Pastor, O.Roig, J.Cortadela, and R.M.Badia, "Petri net analysis using boolean manipulation," in Lecture Notes in Computer Science, ed. R.Valletta, pp.416-435, Springer-Verlag, Berlin, 1994.
2. O.Roig, J.Cortadella, and E.Pastor, "Verification of asynchronous circuits by BBD-based model checking of Petri nets," in Lecture Notes in Computer Science, eds. G.D.Michelis and M. Daiz, pp.374 -391, Springer-Verlag, Berlin, 1995.
3. R.Brgan and D.Poitrenaud, "An efficient algorithm for the computation of stubborn sets of well formed Petri nets," in Lecture Notes in Computer Science, eds. G.D.Michelis and M.Daiz, pp.121-140, Springer-Verlag, Berlin, 1995.
4. S.Caselli, G.Conte, and P.Marenzoni, "Parallel state space exploration for GSPN models," in Lecture Notes in Computer Science, eds. G.D.Michelis and M.Daiz, pp.181-200, 1995.
5. K.Hiraishi and M.Nakano, "On symbolic model checking in Petri nets," IEICE Trans. Fundamentals, vol.E78-A, no.11, pp.1479-1486, Nov. 1995.
6. T.Murata, "Petri nets: Properties, analysis and applications," Proc. IEEE, vol.77, pp.541-580, 1989.
7. S.Kobayashi, I.Ono, and M.Yamamura, "An efficient genetic algorithm for job shop scheduling problems," Proc. 6th ICGA, pp.506-511, 1995.
8. H.Sato, M.Yamamura, and S.Kobayashi, "An analysis of genetic algorithms with population dynamics," Proc. IIZUKA94, pp.449-452, 1994.
9. D.Mitchell, B.Selman, and H.Levesque, "Hard and Easy Distributions of SAT Problems," Proc. AAA192, pp.459-465, 1992.
10. A.Kamath, R.Motwani, K.Palem, and P.Spirakis, 'Tail bounds for occupancy and satisfiability threshold conjecture," Proc. 35th IEEE ASFC, pp.592-603, 1994.
11. D.E.Goldberg, "Genetic algorithms in search, optimization and machine learning," Reading, Mass.: Addison-Wesley, 1989.
12. J.H.Holland, "Adaptation in natural and artificial systems," Ann Arbor: The University of Michigan Press, 1975.