{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:30:10Z","timestamp":1725892210128},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388708"},{"type":"electronic","value":"9783540388722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841883_29","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T11:29:11Z","timestamp":1158665351000},"page":"414-429","source":"Crossref","is-referenced-by-count":11,"title":["Heuristic Search for the Analysis of Graph Transition Systems"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahid","family":"Jabbar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto Lluch","family":"Lafuente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., K\u00f6nig, B.: Verifying a behavioural logic for graph transformation systems. In: CoMeta 2003. ENTCS (2004)","DOI":"10.1016\/j.entcs.2004.08.018"},{"issue":"1\u20132","key":"29_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B. Bonet","year":"2001","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence\u00a0129(1\u20132), 5\u201333 (2001)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0890-5401(03)00137-8","volume":"186","author":"L. Caires","year":"2003","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Inf. Comput.\u00a0186(2), 194\u2013235 (2003)","journal-title":"Inf. Comput."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 597\u2013610. Springer, Heidelberg (2002)"},{"key":"29_CR5","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"29_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"29_CR7","volume-title":"Algebraic approaches to graph transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Basic concepts and double push-out approach. In: Algebraic approaches to graph transformation, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1142\/9789812384720_0005","volume-title":"Handbook of graph grammars and computing by graph transformations. Foundations, ch. 5","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: Handbook of graph grammars and computing by graph transformations. Foundations, ch. 5, vol.\u00a01, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0056478","volume-title":"Distributed Computing","author":"M.J. Demmer","year":"1998","unstructured":"Demmer, M.J., Herlihy, M.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 119\u2013133. Springer, Heidelberg (1998)"},{"key":"29_CR10","unstructured":"Edelkamp, S.: Planning with pattern databases. In: ECP, pp. 13\u201324 (2001)"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1613\/jair.1302","volume":"20","author":"S. Edelkamp","year":"2003","unstructured":"Edelkamp, S.: Taming numbers and durations in the model checking integrated planning system. JAIR\u00a020, 195\u2013238 (2003)","journal-title":"JAIR"},{"key":"29_CR12","first-page":"1362","volume-title":"Cost-algebraic heuristic search","author":"S. Edelkamp","year":"2005","unstructured":"Edelkamp, S., Jabbar, S., Lluch Lafuente, A.: Cost-algebraic heuristic search, pp. 1362\u20131367. AAAI, Menlo Park (2005)"},{"issue":"2-3","key":"29_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10009-002-0104-3","volume":"5","author":"S. Edelkamp","year":"2003","unstructured":"Edelkamp, S., Leue, S., Lluch Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. STTT\u00a05(2-3), 247\u2013267 (2003)","journal-title":"STTT"},{"key":"29_CR14","unstructured":"Edelkamp, S., Lluch Lafuente, A.: Abstraction databases in theory and model checking practice. In: ICAPS Workshop on Connecting Planning Theory with Practice (2004)"},{"key":"29_CR15","unstructured":"Gadducci, F., Lluch Lafuente, A.: Graphical verification of a spatial logic for the pi-calculus. In: Graph Transformation for Verification and Concurrency. ENTCS (to appear, 2005)"},{"key":"29_CR16","volume-title":"ISSTA","author":"A. Groce","year":"2002","unstructured":"Groce, A., Visser, W.: Model checking Java programs using structural heuristics. In: ISSTA. ACM Press, New York (2002)"},{"key":"29_CR17","series-title":"ENTCS","first-page":"137","volume-title":"GT-VMT","author":"S. Gyapay","year":"2004","unstructured":"Gyapay, S., Schmidt, \u00c1., Varr\u00f3, D.: Joint optimization and reachability analysis in graph transformation systems with time. In: GT-VMT. ENTCS, vol.\u00a0109, pp. 137\u2013147. Elsevier, Amsterdam (2004)"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum path cost. IEEE Trans. on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Trans. on Systems Science and Cybernetics"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-44829-2_17","volume-title":"Model Checking Software","author":"T. Henzinger","year":"2003","unstructured":"Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Software verification with Blast. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, pp. 235\u2013239. Springer, Heidelberg (2003)"},{"key":"29_CR20","unstructured":"Hirsch, D., Lluch Lafuente, A., Tuosto, E.: A logic for application level QoS. In: Proceedings of the 3rd Workshop on Quantitative Aspects of Programming Languages"},{"key":"29_CR21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: Fast plan generation through heuristic search. JAIR\u00a014, 253\u2013302 (2001)","journal-title":"JAIR"},{"key":"29_CR22","volume-title":"The Spin Model Checker: Primer and Reference Manual","author":"G. Holzmann","year":"2003","unstructured":"Holzmann, G.: The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2003)"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Kastenberg, H., Rensink, A.: Model checking dynamic states in GROOVE. In: SPIN, pp. 299\u2013305 (2006)","DOI":"10.1007\/11691617_19"},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence\u00a027(1), 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01384313","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design\u00a06, 1\u201335 (1995)","journal-title":"Formal Methods in System Design"},{"key":"29_CR26","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"29_CR27","volume-title":"Heuristics","author":"J. Pearl","year":"1985","unstructured":"Pearl, J.: Heuristics. Addison-Wesley, Reading (1985)"},{"key":"29_CR28","unstructured":"Rensink, A.: Towards model checking graph grammars. In: Automated Verification of Critical Systems, Tech. Report DSSE-TR-2003, pp. 150\u2013160 (2003)"},{"key":"29_CR29","series-title":"ENTCS","first-page":"127","volume-title":"GraBaTs","author":"A. Rensink","year":"2005","unstructured":"Rensink, A.: Time and space issues in the generation of graph transition systems. In: GraBaTs. ENTCS, vol.\u00a0127, pp. 127\u2013139. Elsevier, Amsterdam (2005)"},{"key":"29_CR30","unstructured":"Rensink, A., Distefano, D.: Abstract graph transformation. In: SVV. ENTCS (to appear, 2005)"},{"volume-title":"Handbook of graph grammars and computing by graph transformations","year":"1997","key":"29_CR31","unstructured":"Rozenberg, G. (ed.): Handbook of graph grammars and computing by graph transformations. World Scientific, Singapore (1997)"},{"issue":"4","key":"29_CR32","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TNET.2002.801397","volume":"10","author":"J.L. Sobrinho","year":"2002","unstructured":"Sobrinho, J.L.: Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. IEEE\/ACM Trans. Netw.\u00a010(4), 541\u2013550 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"29_CR33","doi-asserted-by":"crossref","unstructured":"Varr\u00f2, D.: Automated formal verification of visual modeling languages by model checking. Journal on Software and Systems Modeling (2003)","DOI":"10.1007\/s10270-003-0050-x"},{"key":"29_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-55548-0","volume-title":"Komplexit\u00e4tstheorie","author":"I. Wegener","year":"2003","unstructured":"Wegener, I.: Komplexit\u00e4tstheorie. Springer, Heidelberg (2003) (in German)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841883_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:58Z","timestamp":1605642058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841883_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388708","9783540388722"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11841883_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}