{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:11:01Z","timestamp":1743005461649,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591469"},{"type":"electronic","value":"9783319591476"}],"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-59147-6_37","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T21:04:08Z","timestamp":1494968648000},"page":"427-437","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics for ROSA\u2019s LTS Searching"],"prefix":"10.1007","author":[{"given":"Fernando L\u00f3pez","family":"Pelayo","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Cuartero Gomez","sequence":"additional","affiliation":[]},{"given":"Diego","family":"Cazorla","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Valero-Lara","sequence":"additional","affiliation":[]},{"given":"Mercedes Garcia","family":"Merayo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,18]]},"reference":[{"unstructured":"Bloom, B.: Ready simulation, bisimulation, and the semantics of CCS-like languages. Ph.D. thesis, Department of Electrical Engineering and Computer Science, MIT (1989)","key":"37_CR1"},{"issue":"1\u20132","key":"37_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S1567-8326(02)00040-1","volume":"55","author":"D Cazorla","year":"2003","unstructured":"Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebriac theory of probabilistic and nondeterministic processes. J. Logic Algebraic Program. 55(1\u20132), 57\u2013103 (2003)","journal-title":"J. Logic Algebraic Program."},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"R Cleaveland","year":"1993","unstructured":"Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects Comput. 5, 1\u201320 (1993)","journal-title":"Formal Aspects Comput."},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/11841883_29","volume-title":"Graph Transformations","author":"S Edelkamp","year":"2006","unstructured":"Edelkamp, S., Jabbar, S., Lafuente, A.L.: Heuristic search for the analysis of graph transition systems. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 414\u2013429. Springer, Heidelberg (2006). doi:\n10.1007\/11841883_29"},{"issue":"2","key":"37_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ic.2005.07.004","volume":"202","author":"S Gradara","year":"2005","unstructured":"Gradara, S., Santone, A., Villani, M.L.: Using heuristic search for finding deadlocks in concurrent systems. Inf. Comput. 202(2), 191\u2013226 (2005)","journal-title":"Inf. Comput."},{"issue":"2","key":"37_CR6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"37_CR7","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-53982-4_23","volume-title":"TAPSOFT \u201991","author":"Y Ortega-Mall\u00e9n","year":"1991","unstructured":"Ortega-Mall\u00e9n, Y., Frutos-Escrig, D.: A complete proof system for timed observations. In: Abramsky, S., Maibaum, T.S.E. (eds.) CAAP 1991. LNCS, vol. 493, pp. 412\u2013440. Springer, Heidelberg (1991). doi:\n10.1007\/3-540-53982-4_23"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-21498-1_48","volume-title":"Advances in Computational Intelligence","author":"FL Pelayo","year":"2011","unstructured":"Pelayo, F.L., Cuartero, F., Cazorla, D.: Looking for a cheaper ROSA. In: Cabestany, J., Rojas, I., Joya, G. (eds.) IWANN 2011. LNCS, vol. 6692, pp. 380\u2013387. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-21498-1_48"},{"issue":"1","key":"37_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S1571-0661(04)80818-1","volume":"80","author":"FL Pelayo","year":"2003","unstructured":"Pelayo, F.L., Cuartero, F., Valero, V., Cazorla, D.: Analysis of the MPEG-2 encoding algorithm with ROSA. Electron. Notes Theoret. Comput. Sci. 80(1), 185\u2013202 (2003). \nhttps:\/\/doi.org\/10.1016\/S1571-0661(04)80818-1","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"37_CR11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.cam.2006.04.054","volume":"204","author":"FL Pelayo","year":"2007","unstructured":"Pelayo, F.L., Pelayo, M.L., Guirao, J.G.: Generating the syntactic and semantics graphs for a Markovian process algebra. J. Comput. Appl. Math. 204, 38\u201347 (2007)","journal-title":"J. Comput. Appl. Math."},{"unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Technical report DAIMI FN-19, Computer Science Department, Aarhus University (1981)","key":"37_CR12"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59147-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T02:26:09Z","timestamp":1498530369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59147-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591469","9783319591476"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59147-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}