{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:58:38Z","timestamp":1725544718295},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642116223"},{"type":"electronic","value":"9783642116230"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11623-0_15","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:08:29Z","timestamp":1264381709000},"page":"260-275","source":"Crossref","is-referenced-by-count":6,"title":["Automata Based Model Checking for Reo Connectors"],"prefix":"10.1007","author":[{"given":"Marcello M.","family":"Bonsangue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Izadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"15_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"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-40020-2_2","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F. Arbab","year":"2003","unstructured":"Arbab, F., Rutten, J.J.M.M.: A Coinductive Calculus of Component Connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol.\u00a02755, pp. 34\u201355. Springer, Heidelberg (2003)"},{"key":"15_CR3","first-page":"198","volume-title":"Proc. of SEFM 2004","author":"F. Arbab","year":"2004","unstructured":"Arbab, F., Baier, C., de Boer, F., Rutten, J.J.M.M.: Models and Temporal Logics for Timed Component Connectors. In: Proc. of SEFM 2004, pp. 198\u2013207. IEEE Computer Society, Los Alamitos (2004)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.scico.2005.10.008","volume":"61","author":"C. Baier","year":"2006","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modelling Component Connectors in Reo by Constraint Automata. Science of Computer Programming\u00a061, 75\u2013113 (2006)","journal-title":"Science of Computer Programming"},{"key":"15_CR5","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"15_CR6","series-title":"ENTCS","first-page":"61","volume-title":"Proc. of FSEN 2005","author":"D. Clarke","year":"2006","unstructured":"Clarke, D.: Reasoning about Connector Reconfiguration II: Basic reconfiguration Logic. In: Proc. of FSEN 2005. ENTCS, vol.\u00a0159, pp. 61\u201377. Elsevier, Amsterdam (2006)"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.scico.2007.01.009","volume":"66","author":"D. Clarke","year":"2007","unstructured":"Clarke, D., Costa, D., Arbab, F.: Connector Colouring I: Synchronisation and Context Dependency. Science of Computer Programming\u00a066(3), 205\u2013225 (2007)","journal-title":"Science of Computer Programming"},{"key":"15_CR8","unstructured":"Costa, D.: Intensional Constraint Automata. Unpublished notes (2008)"},{"key":"15_CR9","first-page":"3","volume-title":"Proc. of the Int. Sym. on Protocol Specification, Testing, and Verification (PSTV 1995)","author":"R. Gerth","year":"1995","unstructured":"Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple On-the-fly Automatic Verification of Linear Temporal Logic. In: Proc. of the Int. Sym. on Protocol Specification, Testing, and Verification (PSTV 1995), pp. 3\u201318. Chapman & Hall, Boca Raton (1995)"},{"issue":"5","key":"15_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The Model Checker SPIN. IEEE Transactions on Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"15_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley, Reading (2006)","edition":"3"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-85762-4_11","volume-title":"Theoretical Aspects of Computing - ICTAC 2008","author":"M. Izadi","year":"2008","unstructured":"Izadi, M., Bonsangue, M.M.: Recasting Constraint Automata into B\u00fcchi Automata. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol.\u00a05160, pp. 156\u2013170. Springer, Heidelberg (2008)"},{"key":"15_CR13","first-page":"303","volume-title":"Proc. of SEFM 2008","author":"M. Izadi","year":"2008","unstructured":"Izadi, M., Bonsangue, M.M., Clarke, D.: Modeling Component Connectors: Synchronisation and Context-Dependency. In: Proc. of SEFM 2008, pp. 303\u2013312. IEEE Computer Society, Los Alamitos (2008)"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0022-0000(69)80027-9","volume":"3","author":"D.M. Kaplan","year":"1969","unstructured":"Kaplan, D.M.: Regular Expressions and the Equivalence of Programs. Journal of Compiting System Science\u00a03, 361\u2013386 (1969)","journal-title":"Journal of Compiting System Science"},{"key":"15_CR15","series-title":"ENTCS","first-page":"19","volume-title":"Proc. of FOCLASA 2006","author":"S. Kl\u00fcppelholz","year":"2007","unstructured":"Kl\u00fcppelholz, S., Baier, C.: Symbolic Model Checking for Channel-based Component Connectors. In: Proc. of FOCLASA 2006. ENTCS, vol.\u00a0175(2), pp. 19\u201337. Elsevier, Amsterdam (2007)"},{"key":"15_CR16","first-page":"117","volume":"24","author":"D. Kozen","year":"2003","unstructured":"Kozen, D.: Automata on guarded strings and applications. Mat\u00e9matica Contempor\u00e2nea\u00a024, 117\u2013139 (2003)","journal-title":"Mat\u00e9matica Contempor\u00e2nea"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-61474-5_84","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"1996","unstructured":"Kupferman, O., Vardi, M.: Verification of Fair Transition Systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 372\u2013382. Springer, Heidelberg (1996)"},{"key":"15_CR18","unstructured":"Madhusudan, P.: On the Fly Model Checking for Linear Time Temporal Logic. M.Sc. Thesis, Anna University, Madras, India (1996)"},{"key":"15_CR19","unstructured":"Remy, D.: Efficient Representation of Extensible Records. In: Proc. ACM SIGPLAN Workshop on ML and its applications, pp. 12\u201316 (1994)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-71209-1_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y. Tsay","year":"2007","unstructured":"Tsay, Y., Chen, Y., Tsai, M., Wu, K., Chan, W.: GOAL: A Graphical Tool for Manipulating B\u00fcchi Automata and Temporal Formulae. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 466\u2013471. Springer, Heidelberg (2007)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"15_CR22","unstructured":"Vardi, M., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: Proc. of (LICS 1986), pp. 322\u2013331 (1986)"},{"key":"15_CR23","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11623-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:54:40Z","timestamp":1619783680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11623-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642116223","9783642116230"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11623-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}