메뉴 건너뛰기




Volumn 6483 LNCS, Issue , 2010, Pages 339-348

Using the petri nets for the learner assessment in serious games

Author keywords

Game based learning; Learner assessment; Learner misconception; Petri nets; Reachability graph; Serious games

Indexed keywords

GAME-BASED LEARNING; LEARNER ASSESSMENT; LEARNER MISCONCEPTION; REACHABILITY GRAPH; SERIOUS GAMES;

EID: 79956306427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17407-0_35     Document Type: Conference Paper
Times cited : (9)

References (9)
  • 1
    • 34249991205 scopus 로고    scopus 로고
    • Re-purposing existing generic games and simulations for e-learning
    • DOI 10.1016/j.chb.2006.08.002, PII S0747563206000963, Including the Special Issue: Education and Pedagogy with Learning Objects and Learning Designs
    • Burgos, D., Tattersall, C., Koper, R.: Re-purposing existing generic games and simulations for e-learning. Computers in Human Behavior 23(6), 2656-2667 (2007) (Pubitemid 46887646)
    • (2007) Computers in Human Behavior , vol.23 , Issue.6 , pp. 2656-2667
    • Burgos, D.1    Tattersall, C.2    Koper, R.3
  • 3
    • 49449091111 scopus 로고    scopus 로고
    • Can IMS Learning Design be used to model computer-based educational games?
    • Burgos, D., Tattersall, C., Koper, R.: Can IMS Learning Design be used to model computer-based educational games? BINARIA Magazine 5 (2006)
    • (2006) BINARIA Magazine , vol.5
    • Burgos, D.1    Tattersall, C.2    Koper, R.3
  • 6
    • 33745255441 scopus 로고    scopus 로고
    • A petri net model for computer games analysis
    • Natkin, S., Vega, L.: A Petri Net Model for Computer Games Analysis. Int. J. Intell.Games & Simulation 3(1), 37-44 (2004)
    • (2004) Int. J. Intell.Games & Simulation , vol.3 , Issue.1 , pp. 37-44
    • Natkin, S.1    Vega, L.2
  • 8
    • 26944432275 scopus 로고    scopus 로고
    • Petri net reachability checking is polynomial with optimal abstractionhierarchies
    • Zucker, J.-D., Saitta, L. (eds.) SARA 2005. Springer, Heidelberg
    • Küngas, P.: Petri net reachability checking is polynomial with optimal abstractionhierarchies. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp.149-164. Springer, Heidelberg (2005)
    • (2005) LNCS (LNAI) , vol.3607 , pp. 149-164
    • Küngas, P.1


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