{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:32:21Z","timestamp":1745469141308,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357428"},{"type":"electronic","value":"9783642357435"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35743-5_5","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:40:42Z","timestamp":1355449242000},"page":"61-78","source":"Crossref","is-referenced-by-count":4,"title":["A Modal Specification Theory for Components with Data"],"prefix":"10.1007","author":[{"given":"Sebastian S.","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Guldstrand Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrik","family":"Nyman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"W\u0105sowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","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":"5_CR2","doi-asserted-by":"crossref","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer (1980)","DOI":"10.1007\/3-540-10235-3"},{"key":"5_CR3","unstructured":"Nyman, U.: Modal Transition Systems as the Basis for Interface Theories and Product Lines. PhD thesis, Department of Computer Science, Aalborg University (October 2008)"},{"key":"5_CR4","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: Chakraborty, S., Halbwachs, N. (eds.) EMSOFT. ACM (2009)","DOI":"10.1145\/1629335.1629348"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1093\/logcom\/exm062","volume":"18","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., d\u2019Orso, J.: Monotonic and downward closed games. J. Log. Comput.\u00a018(1), 153\u2013169 (2008)","journal-title":"J. Log. Comput."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44685-0_29","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Godefroid","year":"2001","unstructured":"Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-Based Model Checking Using Modal Transition Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 426\u2013440. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"5_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11559306_5","volume-title":"Frontiers of Combining Systems","author":"L. Alfaro de","year":"2005","unstructured":"de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Roy, P., Sorea, M.: Sociable Interfaces. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 81\u2013105. Springer, Heidelberg (2005)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: LICS, pp. 108\u2013117. IEEE Computer Society (1990)","DOI":"10.1109\/LICS.1990.113738"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS, pp. 203\u2013210. IEEE Computer Society (1988)","DOI":"10.1109\/LICS.1988.5119"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-78499-9_9","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Antonik","year":"2008","unstructured":"Antonik, A., Huth, M., Larsen, K.G., Nyman, U., W\u0105sowski, A.: Complexity of Decision Problems for Mixed and Modal Specifications. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 112\u2013126. Springer, Heidelberg (2008)"},{"key":"5_CR12","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)"},{"issue":"41","key":"5_CR13","doi-asserted-by":"publisher","first-page":"4026","DOI":"10.1016\/j.tcs.2009.06.009","volume":"410","author":"N. Benes","year":"2009","unstructured":"Benes, N., Kret\u00ednsk\u00fd, J., Larsen, K.G., Srba, J.: On determinism in modal transition systems. Theor. Comput. Sci.\u00a0410(41), 4026\u20134043 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45449-7_11","volume-title":"Embedded Software","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface Theories for Component-Based Design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol.\u00a02211, pp. 148\u2013165. Springer, Heidelberg (2001)"},{"issue":"28","key":"5_CR15","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.1016\/j.tcs.2011.04.007","volume":"412","author":"S.S. Bauer","year":"2011","unstructured":"Bauer, S.S., Hennicker, R., Wirsing, M.: Interface theories for concurrency and data. Theor. Comput. Sci.\u00a0412(28), 3101\u20133121 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR16","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":"5_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcs.2008.06.023","volume":"215","author":"J.-B. Raclet","year":"2008","unstructured":"Raclet, J.-B.: Residual for component specifications. Electr. Notes Theor. Comput. Sci.\u00a0215, 93\u2013110 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Sa\u00efdi, H.: Construction of Abstract State Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-27815-3_32","volume-title":"Algebraic Methodology and Software Technology","author":"J. Pol van de","year":"2004","unstructured":"van de Pol, J., Valero Espada, M.: Modal Abstractions in \u03bcCRL. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol.\u00a03116, pp. 409\u2013425. Springer, Heidelberg (2004)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/503271.503226","volume":"26","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. SIGSOFT Softw. Eng. Notes\u00a026, 109\u2013120 (2001)","journal-title":"SIGSOFT Softw. Eng. Notes"},{"key":"5_CR21","unstructured":"Lynch, N., Tuttle, M.R.: An introduction to Input\/Output automata. CWI-quarterly\u00a02(3) (1989)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.entcs.2008.06.025","volume":"215","author":"F. Fernandes","year":"2008","unstructured":"Fernandes, F., Royer, J.-C.: The STSLib project: Towards a formal component model based on STS. Electr. Notes Theor. Comput. Sci.\u00a0215, 131\u2013149 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1-2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s12243-008-0069-7","volume":"64","author":"T. Barros","year":"2009","unstructured":"Barros, T., Ameur-Boulifa, R., Cansado, A., Henrio, L., Madelaine, E.: Behavioural models for distributed fractal components. Annales des T\u00e9l\u00e9communications\u00a064(1-2), 25\u201343 (2009)","journal-title":"Annales des T\u00e9l\u00e9communications"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-12002-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S.S. Bauer","year":"2010","unstructured":"Bauer, S.S., Mayer, P., Schroeder, A., Hennicker, R.: On Weak Modal Compatibility, Refinement, and the MIO Workbench. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 175\u2013189. Springer, Heidelberg (2010)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-24372-1_30","volume-title":"Automated Technology for Verification and Analysis","author":"S.S. Bauer","year":"2011","unstructured":"Bauer, S.S., Mayer, P., Legay, A.: MIO Workbench: A Tool for Compositional Design with Modal Input\/Output Interfaces. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 418\u2013421. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35743-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T17:54:11Z","timestamp":1745430851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35743-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642357428","9783642357435"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35743-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}