메뉴 건너뛰기




Volumn 815 LNCS, Issue , 1994, Pages 358-375

Liveness in bounded petri nets which are covered by T-invariants

Author keywords

Deadlocks; Linear invariants; Liveness

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84991629351     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58152-9_20     Document Type: Conference Paper
Times cited : (57)

References (12)
  • 2
    • 0026372827 scopus 로고
    • Properties and performance bounds for closed free choice synchronized monoclass queueing networks
    • December
    • J. Campos, G. Chiola, and M. Silva. Properties and performance bounds for closed free choice synchronized monoclass queueing networks. IEEE Transactions on Automatic Control, 36(12), December 1991.
    • (1991) IEEE Transactions on Automatic Control , vol.36 , Issue.12
    • Campos, J.1    Chiola, G.2    Silva, M.3
  • 3
    • 85027503911 scopus 로고
    • To appear in: Graph theoretic Concepts in Computer Science
    • Jörg Desel. Regular marked petri nets. To appear in: Graph theoretic Concepts in Computer Science, 1993.
    • (1993) Regular Marked Petri Nets
    • Desel, J.1
  • 4
    • 0001339967 scopus 로고
    • A polynomial-time algorithm to decide liveness of bounded free choice nets
    • Javier Esparza and Manuel Silva. A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science, (102):185-205, 1992.
    • (1992) Theoretical Computer Science , Issue.102 , pp. 185-205
    • Esparza, J.1    Silva, M.2
  • 6
    • 85034857286 scopus 로고
    • Formal properties of place/transition nets
    • M. Jantzen and R. Valk. Formal properties of place/transition nets. Net Theory and Application, LNCS 84:165-212, 1980.
    • (1980) Net Theory and Application , vol.84 , pp. 165-212
    • Jantzen, M.1    Valk, R.2
  • 7
    • 0020098828 scopus 로고
    • The orderly resolution of memory access conflicts among competing channel processes
    • W.E. Kluge and K. Lautenbach. The orderly resolution of memory access conflicts among competing channel processes. IEEE Transactions of Computers, C-31(3):194-207, 1982.
    • (1982) IEEE Transactions of Computers , vol.C-31 , Issue.3 , pp. 194-207
    • Kluge, W.E.1    Lautenbach, K.2
  • 9
    • 84910517783 scopus 로고
    • Ein kombinatorischer ansatz zur beschreibung und erreichung von fairness in seheduling-problemen
    • (in German)
    • K. Lautenbach. Ein kombinatorischer ansatz zur beschreibung und erreichung von fairness in seheduling-problemen. Applied Computer Science, 8:228-250, 1977. (in German).
    • (1977) Applied Computer Science , vol.8 , pp. 228-250
    • Lautenbach, K.1
  • 10
    • 0003130675 scopus 로고
    • Linear algebraic calculation of deadlocks and traps
    • Voss, Genrich, and Rozenberg, editors, Springer Verlag
    • Kurt Lautenbach. Linear algebraic calculation of deadlocks and traps. In Voss, Genrich, and Rozenberg, editors, Concurrency and Nets, pages 315-336. Springer Verlag, 1987.
    • (1987) Concurrency and Nets , pp. 315-336
    • Lautenbach, K.1
  • 11
    • 0004232902 scopus 로고
    • Springer Verlag, 2nd edition
    • Wolfgang Reisig. Petri nets. Springer Verlag, 2nd edition, 1991.
    • (1991) Petri Nets
    • Reisig, W.1


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