메뉴 건너뛰기




Volumn 5, Issue 12, 2008, Pages 1742-1749

Modeling and simulation of projects with Petri nets

Author keywords

Invariant analysis; Petri nets; Project management; Reachability; Simulation

Indexed keywords


EID: 54149112558     PISSN: 15469239     EISSN: 15543641     Source Type: Journal    
DOI: 10.3844/ajassp.2008.1742.1749     Document Type: Article
Times cited : (11)

References (27)
  • 1
    • 0024645936 scopus 로고
    • Petri nets: Properties, analysis and applications
    • Murata, T., 1989. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77 (4): 541-580.
    • (1989) Proceedings of the IEEE , vol.77 , Issue.4 , pp. 541-580
    • Murata, T.1
  • 4
    • 0000098171 scopus 로고
    • Colored Petri nets and invariant method
    • Jensen, K., 1981. Colored Petri nets and invariant method, Theoretical Comput. Sci., 14: 317-336.
    • (1981) Theoretical Comput. Sci , vol.14 , pp. 317-336
    • Jensen, K.1
  • 5
    • 0020175425 scopus 로고
    • Performance analysis using stochastic petrinets
    • Molloy, M.K., 1982. Performance analysis using stochastic petrinets. IEEE Trans. Comput., VC-31 (9):913-917.
    • (1982) IEEE Trans. Comput , vol.VC-31 , Issue.9 , pp. 913-917
    • Molloy, M.K.1
  • 7
    • 0027801878 scopus 로고
    • Priority nets for scheduling flexible manufacturing systems
    • Ravi Raju, K. and O.V. Krishnaiah Chetty, 1993. Priority nets for scheduling flexible manufacturing systems. J. Manufactur. Sys., 12 (4): 326-340.
    • (1993) J. Manufactur. Sys , vol.12 , Issue.4 , pp. 326-340
    • Ravi Raju, K.1    Krishnaiah Chetty, O.V.2
  • 8
    • 0029368280 scopus 로고
    • Stochastic colored Petri net models of flexible manufacturing systems: Material handling systems and machining
    • Moore, K.E. and S.M. Gupta, 1995. Stochastic colored Petri net models of flexible manufacturing systems: Material handling systems and machining. Comp. Ind. Eng., 29: 333-337.
    • (1995) Comp. Ind. Eng , vol.29 , pp. 333-337
    • Moore, K.E.1    Gupta, S.M.2
  • 9
    • 0000543906 scopus 로고    scopus 로고
    • Petri net extensions for the development of MIMO net models of automated manufacturing systems
    • Ramaswamy, S., K.P. Valavinis, and S. Barer, 1997. Petri net extensions for the development of MIMO net models of automated manufacturing systems. J. Manufactur. Sys., 16 (3): 175-191.
    • (1997) J. Manufactur. Sys , vol.16 , Issue.3 , pp. 175-191
    • Ramaswamy, S.1    Valavinis, K.P.2    Barer, S.3
  • 10
    • 0029207521 scopus 로고
    • Real time Petri nets for modeling, controlling and simulation of local area networks in FMS
    • Kurapati, V. and I. Mohammad, 1995. Real time Petri nets for modeling, controlling and simulation of local area networks in FMS. Comp. Ind. Eng., 28 (1): 147-162.
    • (1995) Comp. Ind. Eng , vol.28 , Issue.1 , pp. 147-162
    • Kurapati, V.1    Mohammad, I.2
  • 15
    • 0022676075 scopus 로고
    • Heuristics for resource constrained scheduling
    • Elsayed, E.A. and N.Z. Nasr, 1986. Heuristics for resource constrained scheduling. Int. J. Production Res., 24 (2): 299-310.
    • (1986) Int. J. Production Res , vol.24 , Issue.2 , pp. 299-310
    • Elsayed, E.A.1    Nasr, N.Z.2
  • 17
    • 0032000111 scopus 로고    scopus 로고
    • Kumar, V.K. A and L.S. Ganesh, 1998. Use of petri nets for resource allocation in projects. IEEE Transactions of Eng. Manag., 45 (1): 49-56.
    • Kumar, V.K. A and L.S. Ganesh, 1998. Use of petri nets for resource allocation in projects. IEEE Transactions of Eng. Manag., 45 (1): 49-56.
  • 18
    • 0034813379 scopus 로고    scopus 로고
    • Applications of petri nets and genetic algorithm to multi-mode multi-resource constrained project scheduling
    • Prashant Reddy, J., S. Kumanan and O.V. Krishnaiah Chetty, 2001. Applications of petri nets and genetic algorithm to multi-mode multi-resource constrained project scheduling. Int. J. Manufactur. Technol., 17: 305-314.
    • (2001) Int. J. Manufactur. Technol , vol.17 , pp. 305-314
    • Prashant Reddy, J.1    Kumanan, S.2    Krishnaiah Chetty, O.V.3
  • 20
    • 54149118759 scopus 로고    scopus 로고
    • Narahari, Y. and N. Viswanadham, 1985. On the invariants of coloured petri nets. Advances of petri nets. Lecture Notes in Comp. Sci., 222, Springer-Verlag, pp: 330-345.
    • Narahari, Y. and N. Viswanadham, 1985. On the invariants of coloured petri nets. Advances of petri nets. Lecture Notes in Comp. Sci., Vol. 222, Springer-Verlag, pp: 330-345.
  • 21
    • 0000098171 scopus 로고
    • Colored petri nets and the invariant method
    • Jensen, K., 1984. Colored petri nets and the invariant method. Theoretical Computer Science, 14: 317-336.
    • (1984) Theoretical Computer Science , vol.14 , pp. 317-336
    • Jensen, K.1
  • 22
    • 0000204625 scopus 로고
    • A simple and fast algorithm to obtain all invariants of a generalized petri net
    • Girault, C. and W. Reisig, Eds, Springer-Verlag, Berlin, Germany
    • Martinez, J. and M. Silva, 1982. A simple and fast algorithm to obtain all invariants of a generalized petri net. In: Girault, C. and W. Reisig, (Eds.), Fachberichte Informatik, 52: 301-310. Springer-Verlag, Berlin, Germany.
    • (1982) Fachberichte Informatik , vol.52 , pp. 301-310
    • Martinez, J.1    Silva, M.2
  • 23
    • 84976353194 scopus 로고
    • Mathematical methods for calculating invariants in petri nets
    • Advances in petri nets 1987, Rozenberg, G, Ed, pp:, Springer Verlag
    • Krueckeberg, F. and M. Jaxy, 1987. Mathematical methods for calculating invariants in petri nets. In: Advances in petri nets 1987 (Lecture Notes in Computer Science 266), Rozenberg, G., (Ed.), pp: 104-131, Springer Verlag.
    • (1987) Lecture Notes in Computer Science , vol.266 , pp. 104-131
    • Krueckeberg, F.1    Jaxy, M.2
  • 24
    • 85115201997 scopus 로고
    • The recursive equivalence of the reachabilty problem and the liveness problem for petri nets and vectors addition systems
    • Hack, M., 1974. The recursive equivalence of the reachabilty problem and the liveness problem for petri nets and vectors addition systems. In: Proceeding 15th Ann. Symp. Switching Automata Theory, pp: 156-164.
    • (1974) Proceeding 15th Ann. Symp. Switching Automata Theory , pp. 156-164
    • Hack, M.1
  • 25
    • 54149091024 scopus 로고
    • The reachabilty problem requires exponential space. New Haven, Ct, Yale University, Rep. 62
    • Lipton, R.J., 1976. The reachabilty problem requires exponential space. New Haven, Ct, Yale University, Depart. Comp. Sci., Res. Rep. 62.
    • (1976) Depart. Comp. Sci., Res
    • Lipton, R.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.