{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:49:37Z","timestamp":1725518977858},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878902"},{"type":"electronic","value":"9783540878919"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-87891-9_9","type":"book-chapter","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T02:48:06Z","timestamp":1223520486000},"page":"130-145","source":"Crossref","is-referenced-by-count":2,"title":["State Space Reduction Techniques for Component Interfaces"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lumpe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Grunske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Guy","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F. Arbab","year":"2004","unstructured":"Arbab, F.: Reo: A Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science\u00a014(3), 329\u2013366 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J.C.M. Baeten","year":"1991","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Real time process algebra. Formal Aspects of Computing\u00a03(2), 142\u2013188 (1991)","journal-title":"Formal Aspects of Computing"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Computer Aided Verification","author":"C. Baier","year":"1997","unstructured":"Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 119\u2013130. Springer, Heidelberg (1997)"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s10009-004-0185-2","volume":"7","author":"S. Blom","year":"2005","unstructured":"Blom, S., Orzan, S.: Distributed state space minimization. International Journal on Software Tools for Technology Transfer (STTT)\u00a07(3), 280\u2013291 (2005)","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1118537.1123063","volume":"31","author":"L. Brim","year":"2006","unstructured":"Brim, L., \u010cern\u00e1, I., Va\u0159ekov\u00e1, P., Zimmerova, B.: Component-Interaction Automata as a Verification-Oriented Component-Based System Specification. SIGSOFT Software Engineering Notes\u00a031(2), 1\u20138 (2006)","journal-title":"SIGSOFT Software Engineering Notes"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/11786160_2","volume-title":"Architecting Systems with Trustworthy Components","author":"M. Broy","year":"2006","unstructured":"Broy, M.: A core theory of interfaces and architecture and its impact on object orientation. In: Reussner, R.H., Stafford, J.A., Szyperski, C.A. (eds.) Architecting Systems with Trustworthy Components. LNCS, vol.\u00a03938, pp. 26\u201347. Springer, Heidelberg (2006)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.entcs.2006.09.030","volume":"182","author":"I. \u010cern\u00e1","year":"2007","unstructured":"\u010cern\u00e1, I., Va\u0159ekov\u00e1, P., Zimmerova, B.: Component Substitutability via Equivalencies of Component-Interaction Automata. Electronic Notes in Theoretical Computer Science\u00a0182, 39\u201355 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/3-540-45657-0_35","volume-title":"Computer Aided Verification","author":"A. Chakrabarti","year":"2002","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Jurdzinski, M., Mang, F.Y.C.: Interface compatibility checking for software modules. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 428\u2013441. Springer, Heidelberg (2002)"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/295558.295570","volume":"8","author":"S.C. Cheung","year":"1999","unstructured":"Cheung, S.C., Kramer, J.: Checking safety properties using compositional reachability analysis. ACM Transactions on Software Engineering and Methodology\u00a08(1), 49\u201378 (1999)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"9_CR10","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":"9_CR11","first-page":"109","volume-title":"Proceedings ESEC\/FSE 2001","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface Automata. In: Gruhn, V., Tjoa, A.M. (eds.) Proceedings ESEC\/FSE 2001, Vienna, Austria, September 2001, pp. 109\u2013120. ACM Press, New York (2001)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45828-X_9","volume-title":"Embedded Software","author":"L. Alfaro de","year":"2002","unstructured":"de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Timed Interfaces. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol.\u00a02491, pp. 108\u2013122. Springer, Heidelberg (2002)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2004.04.030","volume":"97","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Stoelinga, M.: Interfaces: A game-theoretic framework for reasoning about component-based systems. Electronic Notes in Theoretical Computer Science\u00a097, 3\u201323 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R. DeNicola","year":"1995","unstructured":"DeNicola, R., Vaandrager, F.: Three logics for branching bisimulation. Journal of the ACM\u00a042(2), 458\u2013487 (1995)","journal-title":"Journal of the ACM"},{"issue":"2\u20133","key":"9_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J.-C. Fernandez","year":"1990","unstructured":"Fernandez, J.-C.: An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming\u00a013(2\u20133), 219\u2013236 (1990)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1016091902809","volume":"21","author":"K. Fisler","year":"2002","unstructured":"Fisler, K., Vardi, M.Y.: Bisimulation minimization and symbolic model checking. Formal Methods in System Design\u00a021(1), 39\u201378 (2002)","journal-title":"Formal Methods in System Design"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. International Journal of Foundations of Computer Science\u00a010(2), 147\u2013170 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Interactive Markov Chains","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H.: Interactive Markov Chains. LNCS, vol.\u00a02428. Springer, Heidelberg (2002)"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/352591.352593","volume":"9","author":"P. Inverardi","year":"2000","unstructured":"Inverardi, P., Wolf, A.L., Yankelevich, D.: Static checking of system behaviors using derived component assumptions. ACM Transactions on Software Engineering Methodology\u00a09(3), 239\u2013272 (2000)","journal-title":"ACM Transactions on Software Engineering Methodology"},{"issue":"5","key":"9_CR20","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/32.846302","volume":"26","author":"I. Kang","year":"2000","unstructured":"Kang, I., Lee, I., Kim, Y.-S.: An efficient state space generation for the analysis of real-time systems. IEEE Transactions on Software Engineering\u00a026(5), 453\u2013477 (2000)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-45449-7_16","volume-title":"Embedded Software","author":"E.A. Lee","year":"2001","unstructured":"Lee, E.A., Xiong, Y.: System-Level Types for Component-Based Design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol.\u00a02211, pp. 237\u2013253. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 1987, pp. 137\u2013151 (1987)","key":"9_CR22","DOI":"10.1145\/41840.41852"},{"key":"9_CR23","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"doi-asserted-by":"crossref","unstructured":"Nierstrasz, O.: Regular Types for Active Objects. In: Proceedings OOPSLA 1993, September 1993. ACM SIGPLAN Notices, vol.\u00a028, pp. 1\u201315 (1993)","key":"9_CR24","DOI":"10.1145\/165854.167976"},{"issue":"6","key":"9_CR25","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"5th GI Conference on Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"issue":"11","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/TSE.2002.1049404","volume":"28","author":"F. Plasil","year":"2002","unstructured":"Plasil, F., Visnovsky, S.: Behavior protocols for software components. IEEE Transactions on Software Engineering\u00a028(11), 1056\u20131076 (2002)","journal-title":"IEEE Transactions on Software Engineering"},{"unstructured":"PLT Scheme v372 (2008), \n                    \n                      http:\/\/www.plt-scheme.org","key":"9_CR28"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-60915-6_5","volume-title":"Logics for Concurrency","author":"C. Stirling","year":"1996","unstructured":"Stirling, C.: Modal and temporal logics for processes. In: Moller, F., Birtwistle, G.M. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 149\u2013237. Springer, Heidelberg (1996)"},{"unstructured":"Szyperski, C.: Component Software: Beyond Object-Oriented Programming, 2nd edn. Addison-Wesley \/ ACM Press (2002)","key":"9_CR30"},{"issue":"1","key":"9_CR31","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1022407907596","volume":"12","author":"M.H. Beek ter","year":"2003","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Computer Supported Cooperative Work\u00a012(1), 21\u201369 (2003)","journal-title":"Computer Supported Cooperative Work"},{"issue":"3","key":"9_CR32","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"9_CR33","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/244795.244801","volume":"19","author":"D.M. Yellin","year":"1997","unstructured":"Yellin, D.M., Strom, R.E.: Protocol specifications and component adaptors. ACM Transactions on Programming Languages and Systems\u00a019(2), 292\u2013333 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Component-Based Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87891-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T12:43:20Z","timestamp":1551617000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87891-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878902","9783540878919"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87891-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}