{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:27:37Z","timestamp":1740202057609,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135613"},{"type":"electronic","value":"9783642135620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_40","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"443-454","source":"Crossref","is-referenced-by-count":0,"title":["A Categorical View of Timed Weak Bisimulation"],"prefix":"10.1007","author":[{"given":"Natalya","family":"Gribovskaya","sequence":"first","affiliation":[]},{"given":"Irina","family":"Virbitskaite","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"CTCS 1989","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, P.F.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) CTCS 1989. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0015008","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Alur","year":"1994","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A.: The observational power of clocks. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 162\u2013177. Springer, Heidelberg (1994)"},{"issue":"4","key":"40_CR3","first-page":"1","volume":"72","author":"M.V. Andreeva","year":"2006","unstructured":"Andreeva, M.V., Virbitskaite, I.B.: Observational timed equivalences for timed stable event structures. Fundamenta Informaticae\u00a072(4), 1\u201319 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"40_CR4","series-title":"EATCS Monograph","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04995-2","volume-title":"Process algebra with timing","author":"J.C.M. Baeten","year":"2002","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process algebra with timing. EATCS Monograph. Springer, Heidelberg (2002)"},{"key":"40_CR5","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Handbook of Categorical Algebra","author":"F. Borceux","year":"1994","unstructured":"Borceux, F.: Handbook of Categorical Algebra. Encyclopedia of Mathematics and its Applications, vol.\u00a02, 3, 51, 52. Cambridge University Press, Cambridge (1994)"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-30080-9_2","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"E. Bihler","year":"2004","unstructured":"Bihler, E., Vogler, W.: Timed Petri Nets: Efficiency of asynchronous systems. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 25\u201358. Springer, Heidelberg (2004)"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1007\/11523468_82","volume-title":"Automata, Languages and Programming","author":"F. Breugel van","year":"2005","unstructured":"van Breugel, F., Hermida, C., Makkai, M., Worrell, J.: An accessible approach to behavioural pseudometrics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1018\u20131030. Springer, Heidelberg (2005)"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Cattani, G.L., Sassone, V.: Higher dimentional transition systems. In: Proc. LICS 1996, pp. 55\u201362 (1996)","DOI":"10.1109\/LICS.1996.561303"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume-title":"Computer Aided Verification","author":"K. \u010cer\u0101ns","year":"1993","unstructured":"\u010cer\u0101ns, K.: Decidability of bisimulation equivalences for parallel timer processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 302\u2013315. Springer, Heidelberg (1993)"},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11603009_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T. Chatain","year":"2005","unstructured":"Chatain, T., Jard, C.: Time supervision of concurrent systems using symbolic unfoldings of time Petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 196\u2013210. Springer, Heidelberg (2005)"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0304-3975(00)00121-3","volume":"260","author":"A. Corradini","year":"2002","unstructured":"Corradini, A., Grosse-Rhode, M., Heckel, R.: A coalgebraic presentation of structured transition systems. Theoretical Computer Science\u00a0260, 27\u201355 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"40_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ic.2005.02.004","volume":"204","author":"V. Danos","year":"2006","unstructured":"Danos, V., Desharnais, J., Laviolette, F., Panangaden, P.: Bisimulation and cocongruence for probabilistic systems. Information and Computation\u00a0204(4), 503\u2013523 (2006)","journal-title":"Information and Computation"},{"key":"40_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11603009_20","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"W. Fokkink","year":"2005","unstructured":"Fokkink, W., Pang, J., Wijs, A.: Is timed branching bisimilarity an equivalence indeed? In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 258\u2013272. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"40_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-2009-0092","volume":"93","author":"N. Gribovskaya","year":"2009","unstructured":"Gribovskaya, N., Virbitskaite, I.B.: Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems. Fundamenta Informaticae\u00a093(1-3), 127\u2013142 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"40_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11603009_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T.A. Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., Prabhu, V.S.: Quantifying similarities between timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 226\u2013241. Springer, Heidelberg (2005)"},{"key":"40_CR16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3233\/FI-1999-381206","volume":"38","author":"T. Hune","year":"1999","unstructured":"Hune, T., Nielsen, M.: Bisimulation and open maps for timed transition systems. Fundamenta Informaticae\u00a038, 61\u201377 (1999)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"40_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation\u00a0127(2), 164\u2013185 (1996)","journal-title":"Information and Computation"},{"issue":"4","key":"40_CR18","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.ic.2005.11.003","volume":"204","author":"M. Kick","year":"2006","unstructured":"Kick, M., Power, J., Simpson, A.: Coalgebraic semantics for timed processes. Information and Computation\u00a0204(4), 588\u2013609 (2006)","journal-title":"Information and Computation"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084807","volume-title":"CONCUR \u201992","author":"A.S. Klusener","year":"1992","unstructured":"Klusener, A.S.: The silent step in time. In: Cleaveland, R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630. Springer, Heidelberg (1992)"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Lasota, S.: Coalgebra morphisms subsume open maps. Electronic Notes in Theoretical Computer Science\u00a019 (1999)","DOI":"10.1016\/S1571-0661(05)80266-X"},{"key":"40_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(99)00303-5","volume":"238","author":"M. Roggenbach","year":"2000","unstructured":"Roggenbach, M., Majster-Cederbaum, M.: Towards a unified view of bisimulation: a comparative study. Theoretical Computer Science\u00a0238, 81\u2013130 (2000)","journal-title":"Theoretical Computer Science"},{"key":"40_CR22","series-title":"Lecture Notes in Computer Science","first-page":"251","volume-title":"WADT 2008","author":"L. Monteiro","year":"2008","unstructured":"Monteiro, L.: A Coalgebraic Characterization of Behaviours in the Linear Time \u2013 Branching Time Spectrum. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol.\u00a05486, pp. 251\u2013265. Springer, Heidelberg (2008)"},{"key":"40_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-60692-0_54","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Cheng, A.: Observing behaviour categorically. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 263\u2013278. Springer, Heidelberg (1995)"},{"key":"40_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-642-03409-1_25","volume-title":"FCT 2009","author":"E. Oshevskaya","year":"2009","unstructured":"Oshevskaya, E.: Open Maps Bisimulations for Higher Dimensional Automata Models. In: Kutylowski, M., Charatonik, W., Ge\u0327bala, M. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 274\u2013286. Springer, Heidelberg (2009)"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Rothe, J., Masulovic, D.: Towards weak bisimulation for coalgebras. Electronic Notes in Theoretical Computer Science\u00a068(1) (2002)","DOI":"10.1016\/S1571-0661(04)80499-7"},{"issue":"4\/5","key":"40_CR26","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1051\/ita:1999125","volume":"33","author":"J. Rutten","year":"1999","unstructured":"Rutten, J.: A note on coinduction and weak bisimilarity for while programs. Informatique Theorique et Applications\u00a033(4\/5), 393\u2013400 (1999)","journal-title":"Informatique Theorique et Applications"},{"issue":"1","key":"40_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"40_CR28","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.entcs.2004.06.050","volume":"122","author":"A. Sokolova","year":"2005","unstructured":"Sokolova, A., de Vink, E.P., Woracek, H.: Weak Bisimulation for Action-Type Coalgebras. Electronic Notes in Theoretical Computer Science\u00a0122, 211\u2013228 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"40_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/3-540-57182-5_61","volume-title":"Mathematical Foundations of Computer Science 1993","author":"B. Steffen","year":"1993","unstructured":"Steffen, B., Weise, C.: Deciding testing equivalence for real-time processes with dense time. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 703\u2013713. Springer, Heidelberg (1993)"},{"key":"40_CR30","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","volume":"221","author":"E.P. Vink de","year":"1999","unstructured":"de Vink, E.P., Rutten, J.J.M.M.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science\u00a0221, 271\u2013293 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"1-4","key":"40_CR31","first-page":"383","volume":"60","author":"I.B. Virbitskaite","year":"2004","unstructured":"Virbitskaite, I.B., Gribovskaya, N.S.: Open maps and observational equivalences for timed partial order models. Fundamenta Informaticae\u00a060(1-4), 383\u2013399 (2004)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"40_CR32","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0020-0190(01)00215-0","volume":"80","author":"M.B. Zwaag van der","year":"2001","unstructured":"van der Zwaag, M.B.: The cones and foci proof technique for timed transition systems. Information Processing Letters\u00a080(1), 33\u201340 (2001)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:19:26Z","timestamp":1740136766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}