{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:26:22Z","timestamp":1725549982098},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287018"},{"type":"electronic","value":"9783540319030"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549970_2","type":"book-chapter","created":{"date-parts":[[2005,11,11]],"date-time":"2005-11-11T12:53:44Z","timestamp":1131713624000},"page":"15-17","source":"Crossref","is-referenced-by-count":0,"title":["Implicit Representations and Algorithms for the Logic and Stochastic Analysis of Discrete\u2013State Systems"],"prefix":"10.1007","author":[{"given":"Gianfranco","family":"Ciardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"2_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp.\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comp."},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1287\/ijoc.12.3.203.12634","volume":"12","author":"P. Buchholz","year":"2000","unstructured":"Buchholz, P., Ciardo, G., Donatelli, S., Kemper, P.: Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp.\u00a012(3), 203\u2013222 (2000)","journal-title":"INFORMS J. Comp."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-36577-X_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Ciardo","year":"2003","unstructured":"Ciardo, G., Marmorstein, R., Siminiceanu, R.: Saturation unbound. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 379\u2013393. Springer, Heidelberg (2003)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/PNPM.1999.796529","volume-title":"Proc. 8th Int. Workshop on Petri Nets and Performance Models (PNPM 1999)","author":"G. Ciardo","year":"1999","unstructured":"Ciardo, G., Miner, A.S.: A data structure for the efficient Kronecker solution of GSPNs. In: Buchholz, P. (ed.) Proc. 8th Int. Workshop on Petri Nets and Performance Models (PNPM 1999), Zaragoza, Spain, September 1999, pp. 22\u201331. IEEE Comp. Soc. Press, Los Alamitos (1999)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-36126-X_16","volume-title":"Formal Methods in Computer-Aided Design","author":"G. Ciardo","year":"2002","unstructured":"Ciardo, G., Siminiceanu, R.: Using edge-valued decision diagrams for symbolic generation of shortest paths. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517, pp. 256\u2013273. Springer, Heidelberg (2002)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-45069-6_4","volume-title":"Computer Aided Verification","author":"G. Ciardo","year":"2003","unstructured":"Ciardo, G., Siminiceanu, R.: Structural symbolic CTL model checking of asynchronous systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 40\u201353. Springer, Heidelberg (2003)"},{"key":"2_CR7","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, J.: Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol.\u00a03725, pp. 146\u2013161. Springer, Heidelberg (2005)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M. Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.-Y.: Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. Formal Methods in System Design\u00a010, 149\u2013169 (1997)","journal-title":"Formal Methods in System Design"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/12.506433","volume":"45","author":"Y.-T. Lai","year":"1996","unstructured":"Lai, Y.-T., Pedram, M., Vrudhula, B.K.: Formal verification using edge-valued binary decision diagrams. IEEE Trans. Comp.\u00a045, 247\u2013255 (1996)","journal-title":"IEEE Trans. Comp."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/PNPM.2001.953360","volume-title":"Proc. 9th Int. Workshop on Petri Nets and Performance Models (PNPM 2001)","author":"A.S. Miner","year":"2001","unstructured":"Miner, A.S.: Efficient solution of GSPNs using canonical matrix diagrams. In: German, R., Haverkort, B. (eds.) Proc. 9th Int. Workshop on Petri Nets and Performance Models (PNPM 2001), Aachen, Germany, September 2001, pp. 101\u2013110. IEEE Comp. Soc. Press, Los Alamitos (2001)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Plateau, B.: On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In: Proc. ACM SIGMETRICS, Austin, TX, USA, May 1985, pp. 147\u2013153 (1985)","DOI":"10.1145\/317795.317819"},{"key":"2_CR12","first-page":"92","volume-title":"Int. Conference on CAD","author":"A. Srinivasan","year":"1990","unstructured":"Srinivasan, A., Kam, T., Malik, S., Brayton, R.K.: Algorithms for discrete function manipulation. In: Int. Conference on CAD, pp. 92\u201395. IEEE Comp. Soc. Press, Los Alamitos (1990)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Computer Systems and Business Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549970_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:41:35Z","timestamp":1605642095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549970_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287018","9783540319030"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11549970_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}