{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:31Z","timestamp":1725487111038},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540731955"},{"type":"electronic","value":"9783540731962"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73196-2_21","type":"book-chapter","created":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:50:02Z","timestamp":1183683002000},"page":"325-340","source":"Crossref","is-referenced-by-count":7,"title":["Robustness in Interaction Systems"],"prefix":"10.1007","author":[{"given":"Mila","family":"Majster-Cederbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Martens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-39656-7_2","volume-title":"Formal Methods for Components and Objects","author":"F. Arbab","year":"2002","unstructured":"Arbab, F.: Abstract Behavior Types: A Foundation Model for Components and Their Composition. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol.\u00a02852, pp. 33\u201370. Springer, Heidelberg (2002)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Chouali, S., Heisel, M., Souqui\u00e8res, J.: Proving Component Interoperability with B Refinement. In: Proceedings of FACS\u201905. vol. 160. ENTCS, pp. 157\u2013172 (2006)","DOI":"10.1016\/j.entcs.2006.05.021"},{"key":"21_CR3","first-page":"122","volume-title":"Proceedings of ACSD\u201903","author":"S. Moschoyiannis","year":"2003","unstructured":"Moschoyiannis, S., Shields, M.W.: Component-Based Design: Towards Guided Composition. In: Proceedings of ACSD\u201903, pp. 122\u2013131. IEEE Computer Society, Los Alamitos (2003)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bastide, R., Barboni, E.: Software Components: A Formal Semantics Based on Coloured Petri Nets. In: Proceedings of FACS\u201905. vol. 160, ENTCS, pp. 57\u201373 (2006)","DOI":"10.1016\/j.entcs.2006.05.016"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/258077.258078","volume":"6","author":"R. Allen","year":"1997","unstructured":"Allen, R., Garlan, D.: A Formal Basis for Architectural Connection. ACM Trans. Softw. Eng. Methodol.\u00a06(3), 213\u2013249 (1997)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-39656-7_14","volume-title":"Formal Methods for Components and Objects","author":"O. Nierstrasz","year":"2003","unstructured":"Nierstrasz, O., Achermann, F.: A Calculus for Modeling Software Components. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol.\u00a02852, pp. 339\u2013360. Springer, Heidelberg (2003)"},{"key":"21_CR7","series-title":"NATO ASI Series, Series F: Computer and System Sciences","first-page":"101","volume-title":"Calculational System Design, IOS","author":"M. Broy","year":"1999","unstructured":"Broy, M.: Towards a Logical Basis of Software Engineering. In: Broy, M., Steinbr\u00fcggen, R. (eds.) Calculational System Design, IOS. NATO ASI Series, Series F: Computer and System Sciences, vol.\u00a0158, pp. 101\u2013131. Springer, Heidelberg (1999)"},{"key":"21_CR8","series-title":"ENTCS","first-page":"75","volume-title":"Proceedings of FACS\u201905","author":"H. Baumeister","year":"2006","unstructured":"Baumeister, H., Hacklinger, F., Hennicker, R., Knapp, A., Wirsing, M.: A Component Model for Architectural Programming. In: Proceedings of FACS\u201905. ENTCS, vol.\u00a0160, pp. 75\u201396. Elsevier, Amsterdam (2006)"},{"issue":"1-3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.scico.2004.05.014","volume":"55","author":"G. G\u00f6ssler","year":"2005","unstructured":"G\u00f6ssler, G., Sifakis, J.: Composition for Component-Based Modeling. Sci. Comput. Program.\u00a055(1-3), 161\u2013183 (2005)","journal-title":"Sci. Comput. Program."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Sifakis, J.: A Framework for Component-based Construction, SEFM 2005, pp. 293\u2013 300 (2005)","DOI":"10.1109\/SEFM.2005.3"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/978-3-540-24597-1_36","volume-title":"FST TCS 2003","author":"G. G\u00f6ssler","year":"2003","unstructured":"G\u00f6ssler, G., Sifakis, J.: Component-Based Construction of Deadlock-Free Systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003. LNCS, vol.\u00a02914, pp. 420\u2013433. Springer, Heidelberg (2003)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-39656-7_19","volume-title":"Formal Methods for Components and Objects","author":"G. G\u00f6ssler","year":"2002","unstructured":"G\u00f6ssler, G., Sifakis, J.: Composition for Component-Based Modeling. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol.\u00a02852, pp. 443\u2013466. Springer, Heidelberg (2002)"},{"key":"21_CR13","unstructured":"G\u00f6ssler, G.: Prometheus \u2014 A Compositional Modeling Tool for Real-Time Systems. In: Proceedings of RT-TOOLS 2001, Technical report 2001-014, Uppsala University, Department of Information Technology (2001)"},{"key":"21_CR14","first-page":"3","volume-title":"Proceedings of SEFM\u201906","author":"A. Basu","year":"2006","unstructured":"Basu, A., Bozga, M., Sifakis, J.: Modeling Heterogeneous Real-Time Components in BIP. In: Proceedings of SEFM\u201906, pp. 3\u201312. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"21_CR15","unstructured":"Martens, M., Minnameier, C., Majster-Cederbaum, M.: Deciding Liveness in Component-Based Systems is NP-hard. Technical report TR-2006-017, Universit\u00e4t Mannheim (2006)"},{"key":"21_CR16","unstructured":"Majster-Cederbaum, M., Minnameier, C.: Deriving Complexity Results for Interaction Systems from 1-Safe Petrinets (2007) (Submitted for publication)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Majster-Cederbaum, M., Martens, M., Minnameier, C.: Liveness in Interaction Systems (2007) (Submitted for publication)","DOI":"10.1016\/j.entcs.2008.06.021"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1007\/978-3-540-69507-3_77","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"M. Majster-Cederbaum","year":"2007","unstructured":"Majster-Cederbaum, M., Martens, M., Minnameier, C.: A Polynomial-Time-Checkable Sufficient Condition for Deadlock-freeness of Component Based Systems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 888\u2013899. Springer, Heidelberg (2007)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-69507-3_24","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"G. G\u00f6ssler","year":"2007","unstructured":"G\u00f6ssler, G., Graf, S., Majster-Cederbaum, M., Martens, M., Sifakis, J.: An Approach to Modelling and Verification of Component Based Systems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 295\u2013308. Springer, Heidelberg (2007)"},{"key":"21_CR20","unstructured":"Troubitsyna, E.: Developing Fault-Tolerant Control Systems Composed of Self-Checking Components in the Action Systems Formalism. In: Van, H.D., Liu, Z. (eds.) Proceeding of FACS\u201903, TR 284, UNU\/IIST, pp. 167\u2013186 (2003)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-44618-4_39","volume-title":"CONCUR 2000 - Concurrency Theory","author":"B. Charron-Bost","year":"2000","unstructured":"Charron-Bost, B., Toueg, S., Basu, A.: Revisiting Safety and Liveness in the Context of Failures. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 552\u2013565. Springer, Heidelberg (2000)"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-540-71322-7_10","volume-title":"Program Analysis and Compilation","author":"G. G\u00f6ssler","year":"2007","unstructured":"G\u00f6ssler, G., Graf, S., Majster-Cederbaum, M., Martens, M., Sifakis, J.: Ensuring Properties of Interaction Systems. In: Program Analysis and Compilation. LNCS, vol.\u00a04444, pp. 201\u2013224. Springer, Heidelberg (2007)"},{"issue":"2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the Correctness of Multiprocess Programs. IEEE Trans. Software Eng.\u00a03(2), 125\u2013143 (1977)","journal-title":"IEEE Trans. Software Eng."},{"key":"21_CR24","volume-title":"Systems and Software Verification","author":"B. Berard","year":"1999","unstructured":"Berard, B., et al.: Systems and Software Verification. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"21_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A. Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity Results for 1-Safe Nets. Theoretical Computer Science\u00a0147(1-2), 117\u2013136 (1995)","journal-title":"Theoretical Computer Science"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-30579-8_30","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P.C. Attie","year":"2005","unstructured":"Attie, P.C., Chockler, H.: Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 465\u2013481. Springer, Heidelberg (2005)"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Majster-Cederbaum, M., Martens, M.: Robustness in Interaction Systems. Technical report TR-2007-004, Universit\u00e4t Mannheim (2007)","DOI":"10.1007\/978-3-540-73196-2_21"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73196-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:18:03Z","timestamp":1556583483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73196-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540731955","9783540731962"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73196-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}