메뉴 건너뛰기





Volumn 5, Issue , 2000, Pages 3153-3158

Efficient computation of enabled transition bindings in high-level Petri nets

Author keywords

[No Author keywords available]

Indexed keywords

COLOURED PETRI NETS (CPN); CONSTRAINT SATISFACTION PROBLEM (CSP); RESOURCE CONSTRAINTS; TRANSITION BINDINGS;

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

References (8)
  • Reference 정보가 존재하지 않습니다.

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