{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:10:02Z","timestamp":1748902202493,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662505380"},{"type":"electronic","value":"9783662505397"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-50539-7_12","type":"book-chapter","created":{"date-parts":[[2016,4,25]],"date-time":"2016-04-25T15:17:30Z","timestamp":1461597450000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata"],"prefix":"10.1007","author":[{"given":"Tushant","family":"Jha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walid","family":"Belkhir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannick","family":"Chevalier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,26]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-662-45391-9_46","volume-title":"Service-Oriented Computing","author":"L Akroun","year":"2014","unstructured":"Akroun, L., Benatallah, B., Nourine, L., Toumani, F.: Decidability and complexity of simulation preorder for data-centric web services. In: Franch, X., Ghose, A.K., Lewis, G.A., Bhiri, S. (eds.) ICSOC 2014. LNCS, vol. 8831, pp. 535\u2013542. Springer, Heidelberg (2014)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Belkhir, W., Chevalier, Y., Rusinowitch, M.: Fresh-variable automata: application to service composition. In: 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC, pp. 153\u2013160. IEEE Computer Science (2013)","DOI":"10.1109\/SYNASC.2013.28"},{"key":"12_CR3","unstructured":"Belkhir, W., Chevalier, Y., Rusinowitch, M.: Parametrized automata simulation and application to service composition. J. Symb. Comput. (2014). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717114000972"},{"key":"12_CR4","unstructured":"Belkhir, W., Rossi, G., Rusinowitch, M.: A parametrized propositional dynamic logic with application to service synthesis. In: Tenth conference on \u201cAdvances in Modal Logic,\u201d 5\u20138 August 2014, Groningen, The Netherlands, pp. 34\u201353 (2014)"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1142\/S0129054108005759","volume":"19","author":"D Berardi","year":"2008","unstructured":"Berardi, D., Cheikh, F., Giacomo, G.D., Patrizi, F.: Automatic service composition via simulation. Int. J. Found. Comput. Sci. 19(2), 429\u2013451 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7\u201316. IEEE (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-31606-7_11","volume-title":"Implementation and Application of Automata","author":"P Degano","year":"2012","unstructured":"Degano, P., Ferrari, G.-L., Mezzetti, G.: Nominal automata for resource usage control. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 125\u2013137. Springer, Heidelberg (2012)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-41036-9_11","volume-title":"Reachability Problems","author":"G Delzanno","year":"2013","unstructured":"Delzanno, G., Sangnier, A., Traverso, R.: Parameterized verification of broadcast networks of register automata. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 109\u2013121. Springer, Heidelberg (2013)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-55179-4_25","volume-title":"Computer Aided Verification","author":"DL Dill","year":"1992","unstructured":"Dill, D.L., Hu, A.J., Wong-Toi, H.: Checking for language inclusion using simulation preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 255\u2013265. Springer, Heidelberg (1992)"},{"issue":"312","key":"12_CR10","first-page":"1","volume":"4","author":"M Jurdzi\u0144ski","year":"2008","unstructured":"Jurdzi\u0144ski, M., Laroussinie, F., Sproston, J.: Model checking probabilistic timed automata with one or two clocks. Logical Methods Comput. Sci. 4(312), 1\u201328 (2008)","journal-title":"Logical Methods Comput. Sci."},{"issue":"5","key":"12_CR11","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1142\/S0129054110007532","volume":"21","author":"M Kaminski","year":"2010","unstructured":"Kaminski, M., Zeitlin, D.: Finite-memory automata with non-deterministic reassignment. Int. J. Found. Comput. Sci. 21(5), 741\u2013760 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR12","first-page":"329","volume":"9","author":"A Manuel","year":"2011","unstructured":"Manuel, A., Ramanujam, R.: Automata over infinite alphabets. World Sci. Rev. 9, 329\u2013363 (2011)","journal-title":"World Sci. Rev."},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(2:5)2008","volume":"4","author":"A Muscholl","year":"2008","unstructured":"Muscholl, A., Walukiewicz, I.: A lower bound on web services composition. Logical Methods Comput. Sci. 4(2), 1\u201314 (2008)","journal-title":"Logical Methods Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing \u2013 ICSOC 2015 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-50539-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T21:40:01Z","timestamp":1748900401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-50539-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662505380","9783662505397"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-50539-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"26 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoc2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}