메뉴 건너뛰기




Volumn 2324 LNCS, Issue , 2002, Pages 188-199

Symbolic methods for the state space exploration of GSPN models

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; SPACE RESEARCH; STOCHASTIC SYSTEMS;

EID: 84898078100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46029-2_12     Document Type: Conference Paper
Times cited : (15)

References (20)
  • 1
    • 84976753721 scopus 로고
    • A class of generalised stochastic petri Nets for the performance evaluation of multiprocessor systems
    • M. Ajmone-Marsan, G. Conte, and G. Balbo. A class of Generalised Stochastic Petri Nets for the performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems, 2:93-122, 1984.
    • (1984) ACM Transactions on Computer Systems , vol.2 , pp. 93-122
    • Ajmone-Marsan, M.1    Conte, G.2    Balbo, G.3
  • 3
    • 0030246260 scopus 로고    scopus 로고
    • Improving the variable ordering of OBBDs is NP-complete
    • B. Bollig and I. Wegener. Improving the variable ordering of OBBDs is NP-complete. IEEE Transactions on Computers, 45(9):993-1006, 1996.
    • (1996) IEEE Transactions on Computers , vol.45 , Issue.9 , pp. 993-1006
    • Bollig, B.1    Wegener, I.2
  • 5
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • August
    • R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computer Science, C-35(8):677-691, August 1986.
    • (1986) IEEE Transactions on Computer Science , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 6
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary decision diagrams
    • September
    • R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
    • (1992) ACM Computing Surveys , vol.24 , Issue.3 , pp. 293-318
    • Bryant, R.E.1
  • 9
    • 0031120522 scopus 로고    scopus 로고
    • Multi-terminal binary decision diagrams: An efficient data structure for matrix representations
    • M. Fujita, P. McGeer, and J.-Y. Yang. Multi-terminal binary decision diagrams: an efficient data structure for matrix representations. Formal Methods in System Design, 10(2/3):149-169, 1997.
    • (1997) Formal Methods in System Design , vol.10 , Issue.2-3 , pp. 149-169
    • Fujita, M.1    McGeer, P.2    Yang, J.-Y.3
  • 10
    • 84898064645 scopus 로고    scopus 로고
    • Efficient symbolic state-space construction for asynchronous systems
    • December
    • G. Ciardo, G. Luettgen, R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. ICASE Report No. 99-50, December 1999.
    • (1999) ICASE Report No. 99-50
    • Ciardo, G.1    Luettgen, G.2    Siminiceanu, R.3
  • 16
    • 0343749161 scopus 로고    scopus 로고
    • Kronecker operations and sparse matrices with applications to the solution of Markov models
    • December
    • P. Buchholz, G. Ciardo, S. Donatelli and P. Kemper. Kronecker operations and sparse matrices with applications to the solution of Markov models. ICASE Report No. 97-66, December 1997.
    • (1997) ICASE Report No. 97-66
    • Buchholz, P.1    Ciardo, G.2    Donatelli, S.3    Kemper, P.4
  • 20
    • 0034139994 scopus 로고    scopus 로고
    • A probabilistic dynamic technique for the distributed generation of very large state spaces
    • February
    • W.J. Knottenbelt, P.G. Harrison, M.A. Mestern, P.S. Kritzinger. A probabilistic dynamic technique for the distributed generation of very large state spaces. Performance Evaluation, pages 127-148, February 2000.
    • (2000) Performance Evaluation , pp. 127-148
    • Knottenbelt, W.J.1    Harrison, P.G.2    Mestern, M.A.3    Kritzinger, P.S.4


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