{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:04:37Z","timestamp":1762459477222},"publisher-location":"Cham","reference-count":31,"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_10","type":"book-chapter","created":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T02:10:40Z","timestamp":1493863840000},"page":"139-158","source":"Crossref","is-referenced-by-count":13,"title":["Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation"],"prefix":"10.1007","author":[{"given":"Andreas E.","family":"Dalsgaard","sequence":"first","affiliation":[]},{"given":"S\u00f8ren","family":"Enevoldsen","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Fogh","sequence":"additional","affiliation":[]},{"given":"Lasse S.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Tobias S.","family":"Jepsen","sequence":"additional","affiliation":[]},{"given":"Isabella","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"S\u00f8ren M.","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Mads Chr.","family":"Olesen","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Pastva","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,5]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Barnat J. et al.: DiVinE 3.0 \u2013 an explicit-state model checker for multithreaded C & C++ programs. In: Sharygina N., Veith H. (eds) CAV 2013. LNCS, vol 8044, pp. 863\u2013868. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-39799-8_60"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bellettini, C., Camilli, M., Capra, L., Monga, M.: Distributed CTL model checking in the cloud. arXiv preprint arXiv:1310.6670 (2013)","DOI":"10.1109\/SYNASC.2014.52"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-46017-9_11","volume-title":"Model Checking Software","author":"B Bollig","year":"2002","unstructured":"Bollig, B., Leucker, M., Weber, M.: Local parallel model checking for the alternation-free $$\\mu $$ \u03bc -calculus. In: Bo\u0161na\u010dki, D., Leue, S. (eds.) SPIN 2002. LNCS, vol. 2318, pp. 128\u2013147. Springer, Heidelberg (2002). doi: 10.1007\/3-540-46017-9_11"},{"issue":"4","key":"10_CR4","first-page":"559","volume":"68","author":"L Brim","year":"2002","unstructured":"Brim, L., Crhova, J., Yorav, K.: Using assumptions to distribute CTL model checking. ENTCS 68(4), 559\u2013574 (2002)","journal-title":"ENTCS"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66\u201380. Springer, Heidelberg (2005). doi: 10.1007\/11539452_9"},{"key":"10_CR6","unstructured":"Christoffersen, P., Hansen, M., Mariegaard, A., Ringsmose, J.T., Larsen, K.G., Mardare, R.: Parametric verification of weighted systems. In: SynCoP 2015, vol. 44, pp. 77\u201390. OASIcs, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44577-3_12","volume-title":"Informatics","author":"E Clarke","year":"2001","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Progress on the state explosion problem in model checking. In: Wilhelm, R. (ed.) Informatics. LNCS, vol. 2000, pp. 176\u2013194. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44577-3_12"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). doi: 10.1007\/BFb0025774"},{"issue":"11","key":"10_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1592761.1592781","volume":"52","author":"EM Clarke","year":"2009","unstructured":"Clarke, E.M., Emerson, E.A., Sifakis, J.: Model checking: algorithmic verification and debugging. Commun. ACM 52(11), 74\u201384 (2009)","journal-title":"Commun. ACM"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-47677-3_13","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"AE Dalsgaard","year":"2016","unstructured":"Dalsgaard, A.E., Enevoldsen, S., Larsen, K.G., Srba, J.: Distributed computation of fixed points on dependency graphs. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 197\u2013212. Springer, Cham (2016). doi: 10.1007\/978-3-319-47677-3_13"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-28756-5_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A David","year":"2012","unstructured":"David, A., Jacobsen, L., Jacobsen, M., J\u00f8rgensen, K.Y., M\u00f8ller, M.H., Srba, J.: TAPAAL 2.0: integrated development environment for timed-arc Petri nets. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 492\u2013497. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-28756-5_36"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J Esparza","year":"1997","unstructured":"Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Informatica 34(2), 85\u2013107 (1997)","journal-title":"Acta Informatica"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10009-012-0244-z","volume":"15","author":"H Garavel","year":"2013","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2011: a toolbox for the construction and analysis of distributed processes. STTT 15(2), 89\u2013107 (2013)","journal-title":"STTT"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-54862-8_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Gibson-Robinson","year":"2014","unstructured":"Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: FDR3 \u2014 a modern refinement checker for CSP. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 187\u2013201. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54862-8_13"},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory, vol. 200. Oxford University Press Inc, New York (1995)"},{"key":"10_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9946.001.0001","volume-title":"Modeling and Analysis of Communicating Systems","author":"J Groote","year":"2014","unstructured":"Groote, J., Mousavi, M.: Modeling and Analysis of Communicating Systems. The MIT Press, Cambridge (2014)"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10703-005-1493-1","volume":"26","author":"O Grumberg","year":"2005","unstructured":"Grumberg, O., Heyman, T., Schuster, A.: Distributed symbolic model checking for $$\\mu $$ \u03bc -calculus. Formal Methods Syst. Des. 26(2), 197\u2013219 (2005)","journal-title":"Formal Methods Syst. Des."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-38697-8_21","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Heiner","year":"2013","unstructured":"Heiner, M., Rohr, C., Schwarick, M.: MARCIE \u2013 model checking and reachability analysis done efficiently. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 389\u2013399. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38697-8_21"},{"key":"10_CR19","volume-title":"Spin Model Checker, the: Primer and Reference Manual","author":"G Holzmann","year":"2003","unstructured":"Holzmann, G.: Spin Model Checker, the: Primer and Reference Manual. Addison-Wesley Professional, Boston (2003)"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10009-014-0359-5","volume":"18","author":"J Jensen","year":"2016","unstructured":"Jensen, J., Larsen, K., Srba, J., Oestergaard, L.: Efficient model checking of weighted CTL with upper-bound constraints. STTT 18(4), 409\u2013426 (2016)","journal-title":"STTT"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-53401-4_16","volume-title":"Transactions on Petri Nets and Other Models of Concurrency XI","author":"JF Jensen","year":"2016","unstructured":"Jensen, J.F., Nielsen, T., Oestergaard, L.K., Srba, J.: TAPAAL and reachability analysis of P\/T nets. In: Koutny, M., Desel, J., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency XI. LNCS, vol. 9930, pp. 307\u2013318. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53401-4_16"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11691617_8","volume-title":"Model Checking Software","author":"C Joubert","year":"2006","unstructured":"Joubert, C., Mateescu, R.: Distributed on-the-fly model checking and test case generation. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 126\u2013145. Springer, Heidelberg (2006). doi: 10.1007\/11691617_8"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/978-3-662-46681-0_61","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Kant","year":"2015","unstructured":"Kant, G., Laarman, A., Meijer, J., Pol, J., Blom, S., Dijk, T.: LTSmin: high-performance language-independent model checking. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 692\u2013707. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46681-0_61"},{"key":"10_CR24","unstructured":"Kein\u00e4nen, M.: Techniques for solving boolean equation systems. Research Report A105, Doctoral dissertation, Laboratory for Theoretical Computer Science, Helsinki University of Technology, pp. xii+95 (2006)"},{"key":"10_CR25","unstructured":"Keiren, J.J.A.: Advanced reduction techniques for model checking. Ph.D. thesis, Eindhoven University of Technology (2013)"},{"key":"10_CR26","unstructured":"Kordon, F., Garavel, H., Hillah, L.M., Hulin-Hubard, F., Chiardo, G., Hamez, A., Jezequel, L., Miner, A., Meijer, J., Paviot-Adet, E., Racordon, D., Rodriguez, C., Rohr, C., Srba, J., Thierry-Mieg, Y., Trinh, G., Wolf, K.: Complete results for the 2016th edition of the model checking contest. http:\/\/mcc.lip6.fr\/2016\/results.php"},{"key":"10_CR27","unstructured":"Kordon, F., Garavel, H., Hillah, L.M., Hulin-Hubard, F., Linard, A., Beccuti, M., Hamez, A., Lopez-Bobeda, E., Jezequel, L., Meijer, J., Paviot-Adet, E., Rodriguez, C., Rohr, C., Srba, J., Thierry-Mieg, Y., Wolf, K.: Complete results for the 2015th edition of the model checking contest (2015)"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/BFb0012782","volume-title":"Automata, Languages and Programming","author":"D Kozen","year":"1982","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$ \u03bc -calculus. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 348\u2013359. Springer, Heidelberg (1982). doi: 10.1007\/BFb0012782"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Liu, X., Smolka, S.A.: Simple linear-time algorithms for minimal fixed points. In: ICALP 1998. LNCS, vol. 1443, pp. 53\u201366. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0055040"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-45657-0_37","volume-title":"Computer Aided Verification","author":"L Tan","year":"2002","unstructured":"Tan, L., Cleaveland, R.: Evidence-based model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 455\u2013470. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45657-0_37"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-662-53401-4_13","volume-title":"Transactions on Petri Nets and Other Models of Concurrency XI","author":"K Wolf","year":"2016","unstructured":"Wolf, K.: Running LoLA 2.0 in a model checking competition. In: Koutny, M., Desel, J., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency XI. LNCS, vol. 9930, pp. 274\u2013285. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53401-4_13"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T05:51:00Z","timestamp":1658987460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57861-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319578606","9783319578613"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57861-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}