{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:21:25Z","timestamp":1775013685906,"version":"3.50.1"},"reference-count":41,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1134\/s0361768810030023","type":"journal-article","created":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T08:15:43Z","timestamp":1274861743000},"page":"138-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unifying behavioral equivalences of timed transition systems"],"prefix":"10.1134","volume":"36","author":[{"given":"I. B.","family":"Virbitskaite","sequence":"first","affiliation":[]},{"given":"N. S.","family":"Gribovskaya","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2010,5,27]]},"reference":[{"key":"6066_CR1","unstructured":"Van Glabbeek, R.J., Handbook of Process Algebras. Chapter \u201cThe Linear Time \u2014 Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes,\u201d Elsevier, 2001, pp. 3\u201399."},{"key":"6066_CR2","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R., Communicating Sequential Processes, London: Prentice-Hall, 1985."},{"key":"6066_CR3","doi-asserted-by":"crossref","unstructured":"Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Sciences, 1980, vol. 92.","DOI":"10.1007\/3-540-10235-3"},{"key":"6066_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume":"104","author":"D. Park","year":"1981","unstructured":"Park, D., Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Sciences, 1981, vol. 104, pp. 167\u2013183.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola, R. and Hennessy, M., Testing Equivalence for Processes, Theor. Comput. Sci., 1984, vol. 34, pp. 83\u2013133.","journal-title":"Theor. Comput. Sci."},{"key":"6066_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"R.J. Van Glabbeek","year":"2001","unstructured":"Van Glabbeek, R.J. and Goltz, U., Refinement of Actions and Equivalence Notions for Concurrent Systems, Acta Informatica, 2001, vol. 37, pp. 229\u2013327.","journal-title":"Acta Informatica"},{"key":"6066_CR7","doi-asserted-by":"crossref","unstructured":"Rabinovich, A. and Trakhtenbrot, B.A., Behaviour Structures and Nets, Fundamenta Informatica, 1988, vol. 11, no. 4.","DOI":"10.3233\/FI-1988-11404"},{"issue":"2","key":"6066_CR8","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., and Winskel, G., Bisimulation from Open Maps, Information Computation, 1996, vol. 127, no. 2, pp. 164\u2013185.","journal-title":"Information Computation"},{"key":"6066_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-60692-0_54","volume":"1026","author":"M. Nielsen","year":"1996","unstructured":"Nielsen, M. and Cheng, A., Observing Behaviour Categorically, Lecture Notes in Computer Sciences, 1996, vol. 1026, pp. 263\u2013278.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR10","doi-asserted-by":"crossref","unstructured":"Cattani, G.L. and Sassone, V., Higher Dimensional Transition Systems, Logic Comput. Sci., 1996, pp. 55\u201362.","DOI":"10.1109\/LICS.1996.561303"},{"key":"6066_CR11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-540-31982-5_12","volume":"3441","author":"U. Fahrenberg","year":"1998","unstructured":"Fahrenberg, U., A Category of Higher-Dimensional Automata, Lecture Notes in Computer Sciences, 1998, vol. 3441, pp. 187\u2013201.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume":"3185","author":"R. Alur","year":"2004","unstructured":"Alur, R. and Madhusudan, P., Decision Problems for Timed Automata: A Survey, Lecture Notes in Computer Sciences, 2004, vol. 3185, pp. 1\u201324.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR13","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0031995","volume":"600","author":"T.A. Henzinger","year":"1991","unstructured":"Henzinger, T.A., Manna, Z., and Pnueli, A., Timed Transition Systems, Lecture Notes in Computer Sciences, 1991, vol. 600, pp. 226\u2013251.","journal-title":"Lecture Notes in Computer Sciences"},{"issue":"4","key":"6066_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s002360050047","volume":"33","author":"L. Aceto","year":"1996","unstructured":"Aceto, L. and Murphi, D., Timing and Causality in Process Algebra, Acta Informatica, 1996, vol. 33, no. 4, pp. 317\u2013350.","journal-title":"Acta Informatica"},{"key":"6066_CR15","first-page":"640","volume":"600","author":"S. Schneider","year":"1991","unstructured":"Schneider, S., Davies, J., Jackson, D.M., Reed, G.M., Reed, J.M., and Roscoe, A.W., Timed CSP: Theory and Practice, Lecture Notes in Computer Sciences, 1991, vol. 600, pp. 640\u2013675.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR16","volume-title":"A Study of Recoverability of Computing Systems","author":"P. Merlin","year":"1974","unstructured":"Merlin, P., A Study of Recoverability of Computing Systems, PhD Thesis, University of California, Irvine, 1974."},{"key":"6066_CR17","volume-title":"Analysis of Asynchronous Concurrent Systems by Timed Petri Nets","author":"C. Ramchandani","year":"1974","unstructured":"Ramchandani, C., Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, PhD Thesis, Massachusetts Institute of Technology, Cambridge, 1974."},{"key":"6066_CR18","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-61648-9_52","volume":"1135","author":"J.-P. Katoen","year":"1996","unstructured":"Katoen, J.-P., Langerak, R., Latella, D., and Brinksma, E., On Specifying Real-time Systems in a Causality-based Setting, Lecture Notes in Computer Sciences, 1996, vol. 1135, pp. 385\u2013404.","journal-title":"Lecture Notes in Computer Sciences"},{"issue":"1\u20134","key":"6066_CR19","first-page":"383","volume":"60","author":"I.B. Virbitskaite","year":"2004","unstructured":"Virbitskaite, I.B. and Gribovskaya, N.S., Open Maps and Observational Equivalences for Timed Partial Order Models, Fundamenta Informaticae, 2004, vol. 60, no. 1\u20134, pp. 383\u2013399.","journal-title":"Fundamenta Informaticae"},{"key":"6066_CR20","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0015008","volume":"836","author":"R. Alur","year":"1994","unstructured":"Alur, R., Courcoubetis, C., and Henzinger, T.A., The Observational Power of Clocks, Lecture Notes in Computer Sciences, 1994, vol. 836, pp. 162\u2013177.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR21","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume":"663","author":"K. \u010cer\u0101ns","year":"1993","unstructured":"\u010cer\u0101ns, K., Decidability of Bisimulation Equivalences for Parallel Timer Processes, Lecture Notes in Computer Sciences, 1993, vol. 663, pp. 302\u2013315.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR22","first-page":"176","volume":"1200","author":"C. Weise","year":"1997","unstructured":"Weise, C. and Lenzkes, D., Efficient Scaling-invariant Checking of Timed Bisimulation, Lecture Notes in Computer Sciences, 1997, vol. 1200, pp. 176\u2013188.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0304-3975(94)00285-9","volume":"152","author":"L. Aceto","year":"1995","unstructured":"Aceto, L. and Jeffrey, A., A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours, Theoretical Comput. Sci., 1995, vol. 152, pp. 251\u2013268.","journal-title":"Theoretical Comput. Sci."},{"key":"6066_CR24","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11603009_18","volume":"3829","author":"T.A. Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., and Prabhu, V.S., Quantifying Similarities between Timed Systems, Lecture Notes in Computer Sciences, 2005, vol. 3829, pp. 226\u2013241.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR25","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11603009_20","volume":"3829","author":"W. Fokkink","year":"2005","unstructured":"Fokkink, W., Pang, J., and Wijs, A., Is Timed Branching Bisimilarity an Equivalence Indeed? Lecture Notes in Computer Sciences, 2005, vol. 3829, pp. 258\u2013272.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR26","doi-asserted-by":"crossref","unstructured":"Cleaveland, R. and Zwarico, A.E., A Theory of Testing for Real-time, Logic Comput. Sci., 1991, pp. 110\u2013119.","DOI":"10.1109\/LICS.1991.151635"},{"key":"6066_CR27","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/3-540-57182-5_61","volume":"711","author":"B. Steffen","year":"1993","unstructured":"Steffen, B. and Weise, C., Deciding Testing Equivalence for Real-time Processes with Dense Time, Lecture Notes in Computer Sciences, 1993, vol. 711, pp. 703\u2013713.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-30080-9_2","volume":"3185","author":"E. Bihler","year":"2004","unstructured":"Bihler, E. and Vogler, W., Timed Petri Nets: Efficiency of Asynchronous Systems, Lecture Notes in Computer Sciences, 2004, vol. 3185, pp. 25\u201358.","journal-title":"Lecture Notes in Computer Sciences"},{"issue":"s.1\u20134","key":"6066_CR29","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., and Virbitskaite, I.B., Analysis of Timed Concurrent Models Based on Testing Equivalence, Fundamenta Informaticae, 2000, vol. 43, nos. 1\u20134, pp. 1\u201320.","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"6066_CR30","first-page":"1","volume":"72","author":"M.V. Andreeva","year":"2006","unstructured":"Andreeva, M.V. and Virbitskaite, I.B., Observational Timed Equivalences for Timed Stable Event Structures, Fundamenta Informaticae, 2006, vol. 72, no. 4, pp. 1\u201319.","journal-title":"Fundamenta Informaticae"},{"key":"6066_CR31","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3233\/FI-1999-381206","volume":"38","author":"T. Hune","year":"1999","unstructured":"Hune, T. and Nielsen, M., Bisimulation and Open Maps for Timed Transition Systems, Fundamenta Informaticae, 1999, vol. 38, pp. 61\u201377.","journal-title":"Fundamenta Informaticae"},{"key":"6066_CR32","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-03409-1_25","volume":"5699","author":"E.S. Oshevskaya","year":"2009","unstructured":"Oshevskaya, E.S., Open Maps Bisimulations for Higher Dimensional Automata Models, Lecture Notes in Computer Sciences, 2009, vol. 5699, pp. 274\u2013286.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR33","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-2009-0092","volume":"93","author":"N.S. Gribovskaya","year":"2009","unstructured":"Gribovskaya, N.S. and Virbitskaite, I.B., Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems, Fundamenta Informaticae, 2009, vol. 93, pp. 127\u2013142.","journal-title":"Fundamenta Informaticae"},{"key":"6066_CR34","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. and Dill, D., The Theory of Timed Automata, Theoretical Comput. Sci., 1994, vol. 126, pp. 183\u2013235.","journal-title":"Theoretical Comput. Sci."},{"key":"6066_CR35","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-52148-8_2","volume":"407","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R. and Hennessy, M., Testing Equivalence as a Bisimulation Equivalence, Lecture Notes in Computer Sciences, 1989, vol. 407, pp. 11\u201323.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR36","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3-540-61550-4_165","volume":"1113","author":"U. Goltz","year":"1996","unstructured":"Goltz, U. and Wehrheim, H., Causal Testing, Lecture Notes in Computer Sciences, 1996, vol. 1113, pp. 394\u2013406.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR37","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11603009_16","volume":"3829","author":"T. Chatain","year":"2005","unstructured":"Chatain, T. and Jard, C., Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets, Lecture Notes in Computer Sciences, 2005, vol. 3829, pp. 196\u2013210.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR38","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/11901914_23","volume":"4218","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Haddad, S., and Reynier, P.-A., Timed Unfoldings for Networks of Timed Automata, Lecture Notes in Computer Sciences, 2006, vol. 4218, pp. 292\u2013306.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR39","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-63139-9_34","volume":"1248","author":"T. Aura","year":"1997","unstructured":"Aura, T. and Lilius, J., Time Processes for Time Petri Nets, Lecture Notes in Computer Sciences, 1997, vol. 1248, pp. 136\u2013155.","journal-title":"Lecture Notes in Computer Sciences"},{"key":"6066_CR40","volume-title":"Lectures on Category Theory","author":"M.Sh. Tsalenko","year":"1974","unstructured":"Tsalenko, M.Sh. and Shul\u2019geifer, E.G., Lectures on Category Theory, Moscow: Nauka, 1974."},{"key":"6066_CR41","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0168-0072(94)90069-8","volume":"70","author":"A. Joyal","year":"1994","unstructured":"Joyal, A. and Moerdijk, I., A Completeness Theorem for Open Maps, Ann. Pure Applied Logic, 1994, vol. 70, pp. 51\u201386.","journal-title":"Ann. Pure Applied Logic"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810030023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768810030023","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810030023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810030023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:10:20Z","timestamp":1775009420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768810030023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["6066"],"URL":"https:\/\/doi.org\/10.1134\/s0361768810030023","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5]]},"assertion":[{"value":"21 July 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}