{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T16:30:31Z","timestamp":1774801831357,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642329425","type":"print"},{"value":"9783642329432","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32943-2_17","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T04:59:35Z","timestamp":1346129975000},"page":"213-227","source":"Crossref","is-referenced-by-count":6,"title":["Ensuring Reachability by Design"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Caillaud","sequence":"first","affiliation":[]},{"given":"Jean-Baptiste","family":"Raclet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proc. of the 9th ACM SIGSOFT Inter. Symp. on Foundations of Software Engineering (FSE 2001). pp. 109\u2013120. ACM Press (2001)","DOI":"10.1145\/503225.503226"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"CONCUR \u201998 Concurrency Theory","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating Refinement Relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 163\u2013178. Springer, Heidelberg (1998)"},{"key":"17_CR3","unstructured":"Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowski, A.: 20 years of modal and mixed specifications. Bulletin of the EATCS\u00a01(94) (2008)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"B\u00e9rard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., Schnoebelen, P.: Systems and Software Verification. Model-Checking Techniques and Tools. Springer (2001)","DOI":"10.1007\/978-3-662-04558-9"},{"key":"17_CR5","unstructured":"Caillaud, B., Raclet, J.B.: Ensuring reachability by design. Tech. rep., INRIA Research Report 7928 (2012), http:\/\/hal.inria.fr\/hal-00696151"},{"key":"17_CR6","unstructured":"Darondeau, P., Dubreil, J., Marchand, H.: Supervisory control for modal specifications of services. In: Workshop on Discrete Event Systems (WODES 2010), Berlin, Germany, pp. 428\u2013435 (August 2010)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Doyen, L., Henzinger, T.A., Jobstmann, B., Petrov, T.: Interface theories with component reuse. In: Proc. of the 8th Inter. Conf. on Embedded Software (EMSOFT 2008), pp. 79\u201388. ACM Press (2008)","DOI":"10.1145\/1450058.1450070"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-11623-0_16","volume-title":"Fundamentals of Software Engineering","author":"H. Fecher","year":"2010","unstructured":"Fecher, H., de Frutos-Escrig, D., L\u00fcttgen, G., Schmidt, H.: On the Expressiveness of Refinement Settings. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol.\u00a05961, pp. 276\u2013291. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jlap.2008.05.003","volume":"77","author":"H. Fecher","year":"2008","unstructured":"Fecher, H., Schmidt, H.: Comparing disjunctive modal transition systems with an one-selecting variant. J. Log. Algebr. Program.\u00a077(1-2), 20\u201339 (2008)","journal-title":"J. Log. Algebr. Program."},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10626-006-0008-6","volume":"17","author":"G. Feuillade","year":"2007","unstructured":"Feuillade, G., Pinchinat, S.: Modal specifications for the control theory of discrete-event systems. Discrete Event Dynamic Systems\u00a017(2), 181\u2013205 (2007)","journal-title":"Discrete Event Dynamic Systems"},{"issue":"10","key":"17_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MC.2007.364","volume":"40","author":"T.A. Henzinger","year":"2007","unstructured":"Henzinger, T.A., Sifakis, J.: The discipline of embedded systems design. IEEE Computer\u00a040(10), 32\u201340 (2007)","journal-title":"IEEE Computer"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"Programming Languages and Systems","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Modal I\/O Automata for Interface and Product Line Theories. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 64\u201379. Springer, Heidelberg (2007)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: Proc. of the 5th IEEE Symp. on Logic in Computer Science, LICS 1990, pp. 108\u2013117. IEEE Computer Society Press (1990)","DOI":"10.1109\/LICS.1990.113738"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-52148-8_19","volume-title":"Automatic Verification Methods for Finite State Systems","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G.: Modal Specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 232\u2013246. Springer, Heidelberg (1990)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-74407-8_8","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: On Modal Refinement and Consistency. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 105\u2013119. Springer, Heidelberg (2007)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: Proc. of the 3rd Annual Symp. on Logic in Computer Science (LICS 1988), pp. 203\u2013210. IEEE (1988)","DOI":"10.1109\/LICS.1988.5119"},{"issue":"1-2","key":"17_CR17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/FI-2011-413","volume":"108","author":"N. Lohmann","year":"2011","unstructured":"Lohmann, N., Wolf, K.: Compact representations and efficient algorithms for operating guidelines. Fundam. Inform.\u00a0108(1-2), 43\u201362 (2011)","journal-title":"Fundam. Inform."},{"issue":"3","key":"17_CR18","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"Lynch, N., Tuttle, M.R.: An introduction to Input\/Output automata. CWI-quarterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI-quarterly"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Massuthe, P., Schmidt, K.: Operating guidelines - an automata-theoretic foundation for the service-oriented architecture. In: QSIC, pp. 452\u2013457. IEEE Computer Society (2005)","DOI":"10.1109\/QSIC.2005.47"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Raclet, J.B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: Modal interfaces: unifying interface automata and modal specifications. In: Proc. of the 9th Int. Conf. on Embedded Software (EMSOFT 2009), pp. 87\u201396. ACM (2009)","DOI":"10.1145\/1629335.1629348"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2011-390","volume":"107","author":"J.B. Raclet","year":"2011","unstructured":"Raclet, J.B., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: A modal interface theory for component-based design. Fundam. Inform.\u00a0107, 1\u201332 (2011)","journal-title":"Fundam. Inform."},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10257-005-0053-y","volume":"3","author":"A. Wombacher","year":"2005","unstructured":"Wombacher, A., Mahleko, B., Neuhold, E.J.: IPSI-PF - a business process matchmaking engine based on annotated finite state automata. Inf. Syst. E-Business Management\u00a03(2), 127\u2013150 (2005)","journal-title":"Inf. Syst. E-Business Management"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32943-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T10:34:07Z","timestamp":1744022047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32943-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329425","9783642329432"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32943-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}