메뉴 건너뛰기




Volumn 616 LNCS, Issue , 1992, Pages 263-278

An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; PETRI NETS;

EID: 85027188133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55676-1_15     Document Type: Conference Paper
Times cited : (37)

References (10)
  • 1
    • 0039707272 scopus 로고
    • K. Voss, H. J.Genrich, G.Rozenberg: “Concurrency and Nets, Advances of Petri Nets”, Springer, Berlin
    • Best,E.: Some Classes of Live and Safe Petri Nets, in K. Voss, H. J.Genrich, G.Rozenberg: “Concurrency and Nets, Advances of Petri Nets”, Springer, Berlin 1987.
    • (1987) Some Classes of Live and Safe Petri Nets
    • Best, E.1
  • 2
    • 33747416068 scopus 로고    scopus 로고
    • Hildesheimer Informatikberichte 1/89, Institut für Informatik, Universität Hildesheim
    • Esparza.J.: Minimal Deadlocks in Free Choice Nets, Hildesheimer Informatikberichte 1/89, Institut für Informatik, Universität Hildesheim.
    • Minimal Deadlocks in Free Choice Nets
    • Esparza, J.1
  • 7
    • 0003130675 scopus 로고
    • K.Voss, H.J.Genrich, G.Rozenberg: “Concurrency and Nets, Advances in Petri Nets”, Springer, Berlin
    • Lautenbach,K.: Linear Algebraic Calculation of Deadlocks and Traps in K.Voss, H.J.Genrich, G.Rozenberg: “Concurrency and Nets, Advances in Petri Nets”, Springer, Berlin 1987.
    • (1987) Linear Algebraic Calculation of Deadlocks and Traps
    • Lautenbach, K.1


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