{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:40:58Z","timestamp":1725536458091},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032363"},{"type":"electronic","value":"9783642032370"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03237-0_8","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T05:24:37Z","timestamp":1249277077000},"page":"86-101","source":"Crossref","is-referenced-by-count":5,"title":["The Causal Graph Revisited for Directed Model Checking"],"prefix":"10.1007","author":[{"given":"Martin","family":"Wehrle","sequence":"first","affiliation":[]},{"given":"Malte","family":"Helmert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1613\/jair.1146","volume":"18","author":"R.I. Brafman","year":"2003","unstructured":"Brafman, R.I., Domshlak, C.: Structure and complexity in planning with unary operators. Journal of Artificial Intelligence Research\u00a018, 315\u2013349 (2003)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"8_CR2","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00165-004-0034-9","volume":"16","author":"H. Dierks","year":"2004","unstructured":"Dierks, H.: Comparing model-checking and logical reasoning for real-time systems. Formal Aspects of Computing\u00a016(2), 104\u2013120 (2004)","journal-title":"Formal Aspects of Computing"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11691617_2","volume-title":"Model Checking Software","author":"K. Dr\u00e4ger","year":"2006","unstructured":"Dr\u00e4ger, K., Finkbeiner, B., Podelski, A.: Directed model checking with distance-preserving abstractions. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 19\u201334. Springer, Heidelberg (2006)"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10009-002-0104-3","volume":"5","author":"S. Edelkamp","year":"2004","unstructured":"Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology Transfer\u00a05(2), 247\u2013267 (2004)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45139-0_5","volume-title":"Model Checking Software","author":"S. Edelkamp","year":"2001","unstructured":"Edelkamp, S., Lluch-Lafuente, A., Leue, S.: Directed explicit model checking with HSF-SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 57\u201379. Springer, Heidelberg (2001)"},{"key":"8_CR7","first-page":"161","volume-title":"Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS 2004)","author":"M. Helmert","year":"2004","unstructured":"Helmert, M.: A planning heuristic based on causal graph analysis. In: Zilberstein, S., Koehler, J., Koenig, S. (eds.) Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 161\u2013170. AAAI Press, Menlo Park (2004)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M. Helmert","year":"2006","unstructured":"Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research\u00a026, 191\u2013246 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"8_CR9","volume-title":"Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008)","author":"M. Helmert","year":"2008","unstructured":"Helmert, M., Geffner, H.: Unifying the causal graph and additive heuristics. In: Rintanen, J., Nebel, B., Beck, J.C., Hansen, E. (eds.) Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008). AAAI Press, Menlo Park (2008)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-74128-2_4","volume-title":"Model Checking and Artificial Intelligence","author":"J. Hoffmann","year":"2007","unstructured":"Hoffmann, J., Smaus, J.-G., Rybalchenko, A., Kupferschmid, S., Podelski, A.: Using predicate abstraction to generate heuristic functions in Uppaal. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt IV. LNCS, vol.\u00a04428, pp. 51\u201366. Springer, Heidelberg (2007)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/SFCS.1977.16","volume-title":"Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977)","author":"D. Kozen","year":"1977","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), pp. 254\u2013266. IEEE Computer Society, Los Alamitos (1977)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1007\/3-540-48118-4_13","volume-title":"FM\u201999 - Formal Methods","author":"B. Krieg-Br\u00fcckner","year":"1999","unstructured":"Krieg-Br\u00fcckner, B., Peleska, J., Olderog, E.-R., Baer, A.: The UniForM workbench, a universal development environment for formal methods. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol.\u00a01709, pp. 1186\u20131205. Springer, Heidelberg (1999)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11691617_3","volume-title":"Model Checking Software","author":"S. Kupferschmid","year":"2006","unstructured":"Kupferschmid, S., Hoffmann, J., Dierks, H., Behrmann, G.: Adapting an AI planning heuristic for directed model checking. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 35\u201352. Springer, Heidelberg (2006)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-78800-3_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Kupferschmid","year":"2008","unstructured":"Kupferschmid, S., Hoffmann, J., Larsen, K.G.: Fast directed model checking via russian doll abstraction. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 203\u2013217. Springer, Heidelberg (2008)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-540-70545-1_53","volume-title":"Computer Aided Verification","author":"S. Kupferschmid","year":"2008","unstructured":"Kupferschmid, S., Wehrle, M., Nebel, B., Podelski, A.: Faster than Uppaal? In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 552\u2013555. Springer, Heidelberg (2008)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"key":"8_CR17","volume-title":"Heuristics: Intelligent search strategies for computer problem solving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley, Reading (1984)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-24730-2_37","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Qian","year":"2004","unstructured":"Qian, K., Nymeyer, A.: Guided invariant model checking based on abstraction and symbolic pattern databases. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 497\u2013511. Springer, Heidelberg (2004)"},{"key":"8_CR19","first-page":"10","volume":"1","author":"C.L. Seitz","year":"1980","unstructured":"Seitz, C.L.: Ideas about arbiters. Lambda\u00a01, 10\u201314 (1980)","journal-title":"Lambda"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03237-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T12:38:09Z","timestamp":1548419889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03237-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032363","9783642032370"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03237-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}