{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:23:10Z","timestamp":1742916190608,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408284"},{"type":"electronic","value":"9783540452362"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45236-2_22","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T20:08:38Z","timestamp":1277496518000},"page":"381-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Team Automata Satisfying Compositionality"],"prefix":"10.1007","author":[{"given":"Maurice H.","family":"ter Beek","sequence":"first","affiliation":[]},{"given":"Jetty","family":"Kleijn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,9,25]]},"reference":[{"key":"22_CR1","unstructured":"ter Beek, M.H.: Team Automata\u2014A Formal Approach to the Modeling of Collaboration Between System Components. Ph.D. thesis, Leiden Institute of Advanced Computer Science, Universiteit Leiden (2003)"},{"key":"22_CR2","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Team Automata for CSCW. In: Weber, H., Ehrig, H., Reisig, W. (eds.) Proc. 2nd Int. Coll. on Petri Net Technologies for Modelling Communication Based Systems. Fraunhofer Institute for Software and Systems Engineering, pp. 1\u201320 (2001)"},{"issue":"1","key":"22_CR3","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\u2014The Journal of Collaborative Computing\u00a012(1), 21\u201369 (2003)","journal-title":"Computer Supported Cooperative Work\u2014The Journal of Collaborative Computing"},{"volume-title":"Handbook of Process Algebra","year":"2001","key":"22_CR4","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier Science, Amsterdam (2001)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-36126-X_22","volume-title":"Formal Methods in Computer-Aided Design","author":"J. Carmona","year":"2002","unstructured":"Carmona, J., Cortadella, J.: Input\/Output Compatibility of Reactive Systems. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517, pp. 360\u2013377. Springer, Heidelberg (2002)"},{"key":"22_CR6","first-page":"107","volume-title":"Concurrency and Hardware Design\u2014 Advances in Petri Nets","author":"J. Carmona","year":"2002","unstructured":"Carmona, J., Cortadella, J., Pastor, E.: Synthesis of Reactive Systems: Application to Asynchronous Circuit Design. In: Cortadella, J., Yakovlev, A., Rozenberg, G. (eds.) Concurrency and Hardware Design\u2014 Advances in Petri Nets, pp. 107\u2013151. Springer, Heidelberg (2002)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90128-2","volume":"31","author":"R. Simone De","year":"1984","unstructured":"De Simone, R.: Langages Infinitaires et Produit de Mixage. Theoretical Computer Science\u00a031, 83\u2013100 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/176584.176587","volume":"41","author":"D. Drusinsky","year":"1994","unstructured":"Drusinsky, D., Harel, D.: On the Power of Bounded Concurrency I: Finite Automata. Journal of the ACM\u00a041(3), 517\u2013539 (1994)","journal-title":"Journal of the ACM"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1145\/266838.267363","volume-title":"Proc. Int. Conf. on Supporting Group Work: The Integration Challenge","author":"C.A. Ellis","year":"1997","unstructured":"Ellis, C.A.: Team Automata for Groupware Systems. In: Hayne, S.C., Prinz, W. (eds.) Proc. Int. Conf. on Supporting Group Work: The Integration Challenge, pp. 415\u2013424. ACM Press, New York (1997)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/321281.321294","volume":"12","author":"S. Ginsburg","year":"1965","unstructured":"Ginsburg, S., Spanier, E.H.: Mappings of Languages by Two-Tape Devices. Journal of the ACM\u00a012(3), 423\u2013434 (1965)","journal-title":"Journal of the ACM"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"Harel, D.: Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming\u00a08, 231\u2013274 (1987)","journal-title":"Science of Computer Programming"},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1145\/176584.176588","volume":"41","author":"T. Hirst","year":"1994","unstructured":"Hirst, T., Harel, D.: On the Power of Bounded Concurrency II: Pushdown Automata. Journal of the ACM\u00a041(3), 540\u2013554 (1994)","journal-title":"Journal of the ACM"},{"key":"22_CR13","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(81)90054-2","volume":"14","author":"M. Jantzen","year":"1981","unstructured":"Jantzen, M.: The Power of Synchronizing Operations on Strings. Theoretical Computer Science\u00a014, 127\u2013154 (1981)","journal-title":"Theoretical Computer Science"},{"key":"22_CR15","unstructured":"Jonsson, B.: Compositional Verification of Distributed Systems. Ph.D. thesis, Department of Computer Systems, Uppsala University (1987)"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/174662.174665","volume":"16","author":"B. Jonsson","year":"1994","unstructured":"Jonsson, B.: Compositional Specification and Verification of Distributed Systems. ACM Transactions on Programming Languages and Systems\u00a016(2), 259\u2013303 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"22_CR17","first-page":"92","volume-title":"Proc. 8th Symp. on Theory of Computing","author":"T. Kimura","year":"1976","unstructured":"Kimura, T.: An Algebraic System for Process Structuring and Interprocess Communication. In: Proc. 8th Symp. on Theory of Computing, pp. 92\u2013100. ACM Press, New York (1976)"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2000-42101","volume":"42","author":"R. Lanotte","year":"2000","unstructured":"Lanotte, R., Maggiolo-Schettini, A., Peron, A.: Timed Cooperating Automata. Fundamenta Informaticae\u00a042, 1\u201321 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-60207-8_4","volume-title":"Jewels are Forever","author":"M. Latteux","year":"1999","unstructured":"Latteux, M., Roos, Y.: Synchronized Shuffle and Regular Languages. In: Karhum\u00e4ki, J., Maurer, H.A., P\u0103un, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 35\u201344. Springer, Heidelberg (1999)"},{"issue":"3","key":"22_CR20","first-page":"219","volume":"2","author":"N.A. Lynch","year":"1989","unstructured":"Lynch, N.A., Tuttle, M.R.: An Introduction to Input\/Output Automata. CWI Quarterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI Quarterly"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-40981-6_4","volume-title":"Formal Aspects of Security","author":"D. Oheimb von","year":"2003","unstructured":"von Oheimb, D.: Interacting State Machines: A Stateful Approach to Proving Security. In: Abdallah, A.E., Ryan, P.Y.A., Schneider, S. (eds.) FASec 2002. LNCS, vol.\u00a02629, pp. 15\u201332. Springer, Heidelberg (2003)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45853-0_13","volume-title":"Computer Security - ESORICS 2002","author":"D. Oheimb von","year":"2002","unstructured":"von Oheimb, D., Lotz, V.: Formal Security Analysis with Interacting State Machines. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 212\u2013228. Springer, Heidelberg (2002)"},{"key":"22_CR23","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)"},{"key":"22_CR24","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, London (1973)"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0031414","volume-title":"Trace Theory and VLSI Design","author":"J.L.A. Snepscheut van de","year":"1985","unstructured":"van de Snepscheut, J.L.A.: Trace Theory and VLSI Design. LNCS, vol.\u00a0200. Springer, Heidelberg (1985)"},{"key":"22_CR26","unstructured":"Tuttle, M.R.: Hierarchical Correctness Proofs for Distributed Algorithms. Master\u2019s thesis, Department of Electrical Engineering and Computer Science, MIT (1987)"}],"container-title":["Lecture Notes in Computer Science","FME 2003: Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45236-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T13:09:03Z","timestamp":1579784943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45236-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408284","9783540452362"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45236-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"25 September 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}