{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:19:56Z","timestamp":1737436796720,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739395"},{"type":"electronic","value":"9783540739401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73940-1_4","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T13:30:14Z","timestamp":1188307814000},"page":"35-46","source":"Crossref","is-referenced-by-count":0,"title":["A Categorical Observation of Timed Testing Equivalence"],"prefix":"10.1007","author":[{"given":"Natalya","family":"Gribovskaya","sequence":"first","affiliation":[]},{"given":"Irina","family":"Virbitskaite","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Mathematical Models for the Semantics of Parallelism","author":"L. Aceto","year":"1987","unstructured":"Aceto, L., De Nicola, R., Fantechi, A.: Testing equivalences for event structures. In: Venturini Zilli, M. (ed.) Mathematical Models for the Semantics of Parallelism. LNCS, vol.\u00a0280, pp. 1\u201320. Springer, Heidelberg (1987)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: The theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0031988","volume-title":"Real-Time: Theory in Practice","author":"R. Alur","year":"1992","unstructured":"Alur, R., Henziger, T.A.: Logics and models of real time: a survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) Real-Time: Theory in Practice. LNCS, vol.\u00a0600, pp. 74\u2013106. Springer, Heidelberg (1992)"},{"issue":"1\u20134","key":"4_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2000-43123401","volume":"43","author":"M.V. Andreeva","year":"2000","unstructured":"Andreeva, M.V., Bozhenkova, E.N., Virbitskaite, I.B.: Analysis of timed concurrent models based on testing equivalence. Fundamenta Informaticae\u00a043(1\u20134), 1\u201320 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR5","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.) Formal Methods for the Design of Real-Time Systems. LNCS, vol.\u00a03185, pp. 25\u201358. Springer, Heidelberg (2004)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-45541-8_10","volume-title":"Unifying Petri Nets","author":"E. Badouel","year":"2001","unstructured":"Badouel, E., Bednarczyk, M., Darondeau, P.: Generalized automata and their net representations. In: Ehrig, H., Juh\u00e1s, G., Padberg, J., Rozenberg, G. (eds.) Unifying Petri Nets. LNCS, vol.\u00a02128, pp. 304\u2013345. Springer, Heidelberg (2001)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Borceux, F.: Handbook of Categorical Algebra, vol. 2(3). Encyclopedia of Mathematics and its Applications, vol. 51(52). Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511525865"},{"key":"4_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":"4_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":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Zwarico, A.E.: A theory of testing for real-time. In: Proc. LICS 1991, pp. 110\u2013119 (1991)","DOI":"10.1109\/LICS.1991.151635"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Fiore, M., Cattani, G.L., Winskel, G.: Weak bisimulation and open maps. In: Proc. LICS 1999, pp. 214\u2013225 (1999)","DOI":"10.1109\/LICS.1999.782590"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-540-31982-5_12","volume-title":"Foundations of Software Science and Computational Structures","author":"U. Fahrenberg","year":"2005","unstructured":"Fahrenberg, U.: A Category of Higher-Dimensional Automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 187\u2013201. Springer, Heidelberg (2005)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR 1993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time \u2013 branching time spectrum II: the semantics of sequential systems with silent moves. Extended abstract. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R. Glabbeek","year":"1989","unstructured":"Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of action. In: Kreczmar, A., Mirkowska, G. (eds.) Mathematical Foundations of Computer Science 1989. LNCS, vol.\u00a0379, pp. 237\u2013248. Springer, Heidelberg (1989)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3-540-61550-4_165","volume-title":"Mathematical Foundations of Computer Science 1996","author":"U. Goltz","year":"1996","unstructured":"Goltz, U., Wehrheim, H.: Causal testing. In: Penczek, W., Sza\u0142as, A. (eds.) Mathematical Foundations of Computer Science 1996. LNCS, vol.\u00a01113, pp. 394\u2013406. Springer, Heidelberg (1996)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0031995","volume-title":"Real-Time: Theory in Practice","author":"T.A. Henzinger","year":"1992","unstructured":"Henzinger, T.A., Manna, Z., Pnueli, A.: Timed transition systems. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) Real-Time: Theory in Practice. LNCS, vol.\u00a0600, pp. 226\u2013251. Springer, Heidelberg (1992)"},{"key":"4_CR17","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 fot timed transition systems. Fundamenta Informaticae\u00a038, 61\u201377 (1999)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR18","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"Jacobs, B., Rutten, J.: A tutorial on (Co)algebras and (Co)induction. EATCS Bulletin\u00a062, 222\u2013259 (1997)","journal-title":"EATCS Bulletin"},{"issue":"2","key":"4_CR19","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"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equiavalence for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"4_CR21","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.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a01026, pp. 263\u2013278. Springer, Heidelberg (1995)"},{"key":"4_CR22","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)"},{"issue":"1-4","key":"4_CR23","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"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BFb0023458","volume-title":"STACS 1997","author":"C. Weise","year":"1997","unstructured":"Weise, C., Lenzkes, D.: Efficient scaling-invariant checking of timed bisimulation. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 176\u2013188. Springer, Heidelberg (1997)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. Handbook of Logic in Computer Science 4 (1995)","DOI":"10.1093\/oso\/9780198537809.003.0001"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73940-1_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:05:39Z","timestamp":1737396339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73940-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739395","9783540739401"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73940-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}