{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:14Z","timestamp":1725487094416},"publisher-location":"Berlin, Heidelberg","reference-count":30,"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_10","type":"book-chapter","created":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T04:50:02Z","timestamp":1183697402000},"page":"143-159","source":"Crossref","is-referenced-by-count":6,"title":["New Bisimulation Semantics for Distributed Systems"],"prefix":"10.1007","author":[{"given":"David","family":"de Frutos-Escrig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Rosa-Velardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Gregorio-Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.P.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01178506","volume":"28","author":"E. Best","year":"1991","unstructured":"Best, E., Devillers, R., Kiehn, A., Pomello, L.: Concurrent bisimulation in Petri nets. Acta Informatica\u00a028, 231\u2013264 (1991)","journal-title":"Acta Informatica"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. Journal of ACM\u00a042(1), 232\u2013268 (1995)","journal-title":"Journal of ACM"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(88)90096-5","volume":"59","author":"G. Boudol","year":"1988","unstructured":"Boudol, G., Castellani, I.: Concurrency and atomicity. Theoretical Computer Science\u00a059, 25\u201384 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1145\/76359.76369","volume":"36","author":"I. Castellani","year":"1989","unstructured":"Castellani, I., Hennessy, M.: Distributed bisimulations. Journal of the ACM\u00a036(4), 887\u2013911 (1989)","journal-title":"Journal of the ACM"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"de Simone, R.: Higher-Level Synchronising Devices in Meije-SCCS. Theoretical Computer Science\u00a037, 245\u2013267 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(92)90298-T","volume":"102","author":"R.R. Devillers","year":"1992","unstructured":"Devillers, R.R.: Maximality Preserving Bisimulation. Theor. Comput. Sci.\u00a0102(1), 165\u2013183 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science\u00a0311, 221\u2013256 (2004)","journal-title":"Theoretical Computer Science"},{"key":"10_CR9","first-page":"67","volume-title":"Logic in Computer Science, LICS 1999","author":"M.P. Fiore","year":"1999","unstructured":"Fiore, M.P., Cattani, G.L., Winskel, G.: Weak Bisimulation and Open Maps. In: Logic in Computer Science, LICS 1999, pp. 67\u201376. IEEE Computer Society, Los Alamitos (1999)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Frontiers of WWW Research and Development - APWeb 2006","author":"D. Frutos-Escrig","year":"2006","unstructured":"Frutos-Escrig, D., Marroqu\u00edn-Alonso, O., Rosa-Velardo, F.: Ubiquitous Systems and Petri Nets. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, vol.\u00a03841, Springer, Heidelberg (2006)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/11539452_23","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"D. Frutos-Escrig","year":"2005","unstructured":"Frutos-Escrig, D., Gregorio-Rodr\u00edguez, C.: Bisimulations Up-to for the Linear Time Branching Time Spectrum. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 278\u2013292. Springer, Heidelberg (2005)"},{"key":"10_CR12","unstructured":"Frutos-Escrig, D., Palomino, M., F\u00e1bregas, I.: Searching for a canonical notion of simulation (in preparation)"},{"key":"10_CR13","first-page":"127","volume-title":"10th Int.Conf. on Formal Description Techniques and Protocol Specification, Testing and Verification, FORTE\u201997","author":"G.F. Lucero","year":"1998","unstructured":"Lucero, G.F., Quemada, J.: Specifying the ODP Trader: An Introduction to E-LOTOS. In: 10th Int.Conf. on Formal Description Techniques and Protocol Specification, Testing and Verification, FORTE\u201997. IFIP Conference Proceedings, vol.\u00a0107, pp. 127\u2013142. Chapman & Hall, Sydney (1998)"},{"issue":"1-2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.07.022","volume":"327","author":"J. Hughes","year":"2004","unstructured":"Hughes, J., Jacobs, B.: Simulations in coalgebra. Theoretical Computer Science\u00a0327(1-2), 71\u2013108 (2004)","journal-title":"Theoretical Computer Science"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11562436_24","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"A. Kiehn","year":"2005","unstructured":"Kiehn, A., Arun-Kumar, S.: Amortized bisimulations. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 320\u2013334. Springer, Heidelberg (2005)"},{"key":"10_CR16","unstructured":"Jacobs, B.: Introduction to coalgebra. Towards mathematics of states and observations, (Book in preparation) Available at http:\/\/www.cs.ru.nl\/B.Jacobs\/CLG\/JacobsCoalgebraIntro.pdf"},{"key":"10_CR17","volume-title":"Logic in Computer Science, LICS\u201993","author":"A. Joyal","year":"1993","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation and open maps. In: Logic in Computer Science, LICS\u201993, IEEE Computer Society, Los Alamitos (1993)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"issue":"1&2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(95)00122-0","volume":"153","author":"M. Nielsen","year":"1996","unstructured":"Nielsen, M., Winskel, G.: Petri Nets and Bisimulation. Theor. Comput. Sci.\u00a0153(1&2), 211\u2013244 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR20","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: 5th GI-Conference on Theoretical Computer Science, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"10_CR21","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. TR DAIMI FN-19, Computer Science Dept., Aarhus Univ. (1981)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Rothe, J., Mas\u0306ulovi\u0107,D.: A syntactical approach to weak (bi)-simulation for coalgebras. In: Coalgebraic Methods in Computer Science, CMCS\u201902. ENTCS, vol. 65(1) Elsevier (2002)","DOI":"10.1016\/S1571-0661(04)80368-2"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.entcs.2005.12.099","volume":"162","author":"D. Sangiorgi","year":"2006","unstructured":"Sangiorgi, D.: Bisimulation and Co-induction: Some Problems. Electr. Notes Theor. Comput. Sci.\u00a0162, 311\u2013315 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10_CR25","unstructured":"Sokolova, A.: On compositions and paths for coalgebras. Technical report CSR-05-26, TU Eindhoven (2005)"},{"key":"10_CR26","series-title":"ENTCS","first-page":"211","volume-title":"Category Theory and Computer Science, CTCS\u201904","author":"A. Sokolova","year":"2005","unstructured":"Sokolova, A., de Vink, E.P., Woracek, H.: Weak Bisimulation for Action-Type Coalgebras. In: Category Theory and Computer Science, CTCS\u201904. ENTCS, vol.\u00a0112, pp. 211\u2013228. Elsevier, North-Holland (2005)"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.: The linear time - branching time spectrum I; the semantics of concrete, sequential processes. In: Handbook of Process Algebra Chapter 1, pp. 3-99. Elsevier, North-Holland (2001)","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-54233-7_158","volume-title":"Automata, Languages and Programming","author":"W. Vogler","year":"1991","unstructured":"Vogler, W.: Deciding History Preserving Bisimilarity. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol.\u00a0510, pp. 495\u2013505. Springer, Heidelberg (1991)"},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(93)90157-O","volume":"114","author":"W. Vogler","year":"1993","unstructured":"Vogler, W.: Bisimulation and Action Refinement. Theor. Comput. Sci.\u00a0114(1), 173\u2013200 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"10_CR30","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.tcs.2006.03.004","volume":"360","author":"G. L\u00fcttgen","year":"2006","unstructured":"L\u00fcttgen, G., Vogler, W.: Bisimulation on speed: A unified approach. Theor. Comput. Sci.\u00a0360(1-3), 209\u2013227 (2006)","journal-title":"Theor. Comput. Sci."}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T04:18:02Z","timestamp":1556597882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73196-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540731955","9783540731962"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73196-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}