{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:52:41Z","timestamp":1743144761379,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041662"},{"type":"electronic","value":"9783642041679"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04167-9_5","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T06:45:02Z","timestamp":1250664302000},"page":"82-101","source":"Crossref","is-referenced-by-count":15,"title":["Formal Verification for Components and Connectors"],"prefix":"10.1007","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Blechmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sascha","family":"Kl\u00fcppelholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"Alur, R., Henzinger, T.: Reactive Modules. Formal Methods in System Design: An Intern. J.\u00a015(1), 7\u201348 (1999)","journal-title":"Formal Methods in System Design: An Intern. J."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T., Kupferman, O.: Alternating-Time Temporal Logic. JACM\u00a049, 672\u2013713 (2002)","journal-title":"JACM"},{"issue":"3","key":"5_CR3","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 Comp. Sci.\u00a014(3), 329\u2013366 (2004)","journal-title":"Mathematical Structures in Comp. Sci."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-02053-7_13","volume-title":"COORDINATION 2009","author":"C. Baier","year":"2009","unstructured":"Baier, C., Blechmann, T., Klein, J., Kl\u00fcppelholz, S.: A Uniform Framework for Modeling and Verifying Components and Connectors. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol.\u00a05521, pp. 247\u2013267. Springer, Heidelberg (2009)"},{"key":"5_CR5","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling Component Connectors in Reo by Constraint Automata. Science of Computer Programming (2006)","DOI":"10.1016\/j.scico.2005.10.008"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Blechmann, T., Baier, C.: Checking equivalence for Reo networks. In: FACS 2007. ENTCS, vol.\u00a0215, pp. 209\u2013226 (2008)","DOI":"10.1016\/j.entcs.2008.06.029"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Browne, M., Clarke, E., Grumberg, O.: Characterizing Finite Kripke Structures in Propositional Temporal Logic. In: TAPSOFT, TCS (1988)","DOI":"10.1016\/0304-3975(88)90098-9"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. Clarke","year":"1986","unstructured":"Clarke, E., Emerson, E., Sistla, A.: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programm. Languages and Systems\u00a08(2), 244\u2013263 (1986)","journal-title":"ACM Transactions on Programm. Languages and Systems"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. In: ACM TOPLAS (1986)","DOI":"10.1145\/5397.5399"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10472-006-9020-7","volume":"46","author":"L. Giordano","year":"2006","unstructured":"Giordano, L., Martelli, A.: Tableau-based automata construction for dynamic linear time temporal logic. Annals of Mathematics and Artificial Intelligence\u00a046(3), 289\u2013315 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1-3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0168-0072(98)00039-6","volume":"96","author":"J.G. Henriksen","year":"1999","unstructured":"Henriksen, J.G., Thiagarajan, P.S.: Dynamic linear time temporal logic. Ann. Pure Appl. Logic\u00a096(1-3), 187\u2013207 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-92188-2_12","volume-title":"Formal Methods for Components and Objects","author":"M.M. Jaghoori","year":"2008","unstructured":"Jaghoori, M.M.: Coordinating object oriented components using data-flow networks. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol.\u00a05382, pp. 280\u2013311. Springer, Heidelberg (2008)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kanellakis","year":"1990","unstructured":"Kanellakis, P., Smolka, S.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation\u00a086(1), 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kl\u00fcppelholz, S., Baier, C.: Symbolic Model Checking for Channel-based Component Connectors. Science of Computer Programming (2009)","DOI":"10.1016\/j.scico.2008.09.020"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-68265-3_12","volume-title":"Coordination Models and Languages","author":"S. Kl\u00fcppelholz","year":"2008","unstructured":"Kl\u00fcppelholz, S., Baier, C.: Alternating-time stream logic for multi-agent systems. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol.\u00a05052, pp. 184\u2013198. Springer, Heidelberg (2008)"},{"key":"5_CR17","first-page":"46","volume-title":"Proc. of 18th FOCS","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The Temporal Logic of Programs. In: Proc. of 18th FOCS, pp. 46\u201357. IEEE Computer Society Press, Los Alamitos (1977)"},{"key":"5_CR18","unstructured":"Reo website\u00a0at CWI\u00a0Amsterdam, \n                    \n                      http:\/\/reo.project.cwi.nl\/"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M. Vardi","year":"1996","unstructured":"Vardi, M.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"},{"key":"5_CR20","first-page":"332","volume-title":"LICS","author":"M. Vardi","year":"1986","unstructured":"Vardi, M., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: LICS, pp. 332\u2013345. IEEE Computer Society Press, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04167-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:43:53Z","timestamp":1552117433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04167-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041662","9783642041679"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04167-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}