{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:02:20Z","timestamp":1725886940480},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319578606"},{"type":"electronic","value":"9783319578613"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57861-3_14","type":"book-chapter","created":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T22:10:40Z","timestamp":1493849440000},"page":"223-242","source":"Crossref","is-referenced-by-count":2,"title":["Getting the Priorities Right: Saturation for Prioritised Petri Nets"],"prefix":"10.1007","author":[{"given":"Krist\u00f3f","family":"Marussy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vince","family":"Moln\u00e1r","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"V\u00f6r\u00f6s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Istv\u00e1n","family":"Majzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,5]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/32.214828","volume":"19","author":"G Chiola","year":"1993","unstructured":"Chiola, G., Ajmone, M.M., Balbo, G., Conte, G.: Generalized stochastic Petri nets: a definition at the net level and its implications. IEEE Trans. Softw. Eng. 19(2), 89\u2013107 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.peva.2005.06.001","volume":"63","author":"G Ciardo","year":"2006","unstructured":"Ciardo, G., Jones, R.L., Miner, A.S., Siminiceanu, R.I.: Logic and stochastic modeling with SMART. Perform. Eval. 63(6), 578\u2013608 (2006)","journal-title":"Perform. Eval."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-45319-9_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Ciardo","year":"2001","unstructured":"Ciardo, G., L\u00fcttgen, G., Siminiceanu, R.: Saturation: an efficient iteration strategy for symbolic state\u2014space generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 328\u2013342. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-45319-9_23"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s10009-005-0188-7","volume":"8","author":"G Ciardo","year":"2006","unstructured":"Ciardo, G., Marmorstein, R., Siminiceanu, R.: The saturation algorithm for symbolic state-space exploration. Int. J. Softw. Tools Technol. Transf. 8(1), 4\u201325 (2006)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-5316(93)90026-Q","volume":"18","author":"G Ciardo","year":"1993","unstructured":"Ciardo, G., Trivedi, K.S.: A decomposition approach for stochastic reward net models. Perform. Eval. 18(1), 37\u201359 (1993)","journal-title":"Perform. Eval."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11560548_13","volume-title":"Correct Hardware Design and Verification Methods","author":"G Ciardo","year":"2005","unstructured":"Ciardo, G., Yu, A.J.: Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 146\u2013161. Springer, Heidelberg (2005). doi:\n10.1007\/11560548_13"},{"issue":"1","key":"14_CR7","first-page":"9","volume":"4","author":"T Kam","year":"1998","unstructured":"Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.: Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic 4(1), 9\u201362 (1998)","journal-title":"Multiple-Valued Logic"},{"issue":"1\u20134","key":"14_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.peva.2003.07.005","volume":"56","author":"AS Miner","year":"2004","unstructured":"Miner, A.S.: Implicit GSPN reachability set generation using decision diagrams. Perform. Eval. 56(1\u20134), 145\u2013165 (2004)","journal-title":"Perform. Eval."},{"issue":"8","key":"14_CR9","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/TSE.2006.81","volume":"32","author":"AS Miner","year":"2006","unstructured":"Miner, A.S.: Saturation for a general class of models. IEEE Trans. Softw. Eng. 32(8), 559\u2013570 (2006)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"14_CR10","unstructured":"Moln\u00e1r, V., Majzik, I.: Constraint programming with multi-valued decision diagrams: a saturation approach. In: Proceedings of the 24th PhD Mini-Symposium of the Department of Measurement and Information Systems (2017) (in Preparation)"},{"key":"14_CR11","unstructured":"Roux, P., Siminiceanu, R.: Model checking with edge-valued decision diagrams. In: Proceedings of the 2nd NASA Formal Methods Symposium, pp. 222\u2013226 (2010)"},{"issue":"11","key":"14_CR12","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TSE.2003.1245298","volume":"29","author":"E Teruel","year":"2003","unstructured":"Teruel, E., Franceschinis, G., Pierro, M.D.: Well-defined generalized stochastic Petri nets: a net-level method to specify priorities. IEEE Trans. Softw. Eng. 29(11), 962\u2013973 (2003)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"14_CR13","unstructured":"Tovchigrechko, A.A.: Efficient symbolic analysis of bounded Petri nets using interval decision diagrams. Ph.D. thesis. Brandenburg University of Technology, Cottbus-Senftenberg, Germany (2008)"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Woodside, C.M., Li, Y.: Performance Petri net analysis of communications protocol software by delay-equivalent aggregation. In: Proceedings of the 4th International Workshop on Petri Nets and Performance Models, pp. 64\u201373 (1991)","DOI":"10.1109\/PNPM.1991.238781"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-04761-9_27","volume-title":"Automated Technology for Verification and Analysis","author":"Y Zhao","year":"2009","unstructured":"Zhao, Y., Ciardo, G.: Symbolic CTL model checking of asynchronous systems using constrained saturation. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 368\u2013381. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-04761-9_27"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57861-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T22:14:58Z","timestamp":1493849698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57861-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319578606","9783319578613"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57861-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}