메뉴 건너뛰기




Volumn 643, Issue , 2010, Pages 51-65

Computation of enabled transition instances for colored Petri nets

Author keywords

[No Author keywords available]

Indexed keywords

BINDING PROCESS; COLORED PETRI NETS; CORRESPONDING COLORS; OPTIMIZATION TECHNIQUES; POTENTIAL BINDING;

EID: 84890307870     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (10)
  • 1
    • 0009342508 scopus 로고    scopus 로고
    • Efficient discrete-event simulation of colored petri nets
    • R. Gaeta: Efficient Discrete-Event Simulation of Colored Petri Nets. IEEE Transactions on Software Engineering. 22(9), 629-639 (1996)
    • (1996) IEEE Transactions on Software Engineering. , vol.22 , Issue.9 , pp. 629-639
    • Gaeta, R.1
  • 3
    • 3042841677 scopus 로고    scopus 로고
    • Implementing coloured petri nets using a functional programming language
    • L. M. Kristensen, S. Christensen: Implementing Coloured Petri Nets Using a Functional Programming Language. Higher-Order and Symbolic Computation. 17(3), 207-243 (2004)
    • (2004) Higher-Order and Symbolic Computation. , vol.17 , Issue.3 , pp. 207-243
    • Kristensen, L.M.1    Christensen, S.2
  • 7
    • 84890262265 scopus 로고    scopus 로고
    • Petri Nets World. http://www.informatik.uni-hamburg.de/TGI/PetriNets. (2010)
    • (2010) Petri Nets World
  • 9
    • 77951956151 scopus 로고    scopus 로고
    • Snoopy - A unifying petri net framework to investigate biomolecular networks
    • C. Rohr, W. Marwan, M. Heiner: Snoopy - a unifying Petri net framework to investigate biomolecular networks. Bioinformatics. 26(7): 974-975 (2010)
    • (2010) Bioinformatics , vol.26 , Issue.7 , pp. 974-975
    • Rohr, C.1    Marwan, W.2    Heiner, M.3


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