메뉴 건너뛰기




Volumn , Issue , 1993, Pages 46-55

Towards a simplified building of time Petri Nets reachability graph

Author keywords

reachability graph; state classes; time Petri nets

Indexed keywords

FIRING CONDITIONS; IS-ENABLED; REACHABILITY GRAPHS; STATE CLASSES; SUBGRAPHS; TIME PETRI NETS;

EID: 33749143507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PNPM.1993.393436     Document Type: Conference Paper
Times cited : (45)

References (7)
  • 2
    • 85064753584 scopus 로고
    • An enumerative approach for analyzing time Pctri nets
    • [BER,83] Paris, North-Holland
    • [BER,83] B.Berthomieu, M.Mcnasche "An enumerative approach for analyzing time Pctri nets". IFIP Congress 1983, Paris, North-Holland.
    • (1983) IFIP Congress
    • Berthomieu, B.1    Mcnasche, M.2
  • 3
    • 0026120365 scopus 로고    scopus 로고
    • Modeling and verification of timc dcpcndcnt systems using time Petri ncts
    • [BER,91] March
    • [BER,91] B.Berthomieu, M. Diaz "Modeling and verification of timc dcpcndcnt systems using time Petri ncts", IEEE Transactions on Software Engineering vol 17, N03, March 91.
    • IEEE Transactions on Software Engineering , vol.17 , Issue.3 , pp. 91
    • Berthomieu, B.1    Diaz, M.2
  • 7
    • 69249096998 scopus 로고
    • The derivation of performance cxprcssions for communication protocols for timed Petri ncts
    • [RAZ,84] R.R.Razouk, "The derivation of performance cxprcssions for communication protocols for timed Petri ncts", computcr communication rcvicw, vol. 14, no 12, pp 210-217, 1984.
    • (1984) Computcr Communication Rcvicw , vol.14 , Issue.12 , pp. 210-217
    • Razouk, R.R.1


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