{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:12:19Z","timestamp":1775463139622,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648277","type":"print"},{"value":"9783540685326","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055787","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"378-387","source":"Crossref","is-referenced-by-count":6,"title":["Timed bisimulation and open maps"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hune","sequence":"first","affiliation":[]},{"given":"Mogens","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. Proc. of LICS'97, 1997.","DOI":"10.1109\/LICS.1997.614944"},{"key":"34_CR2","first-page":"322","volume":"433","author":"R. Alur","year":"1990","unstructured":"R. Alur and D.L. Dill. Automata for modelling real-time systems. Proc. of ICALP'90, LNCS 433:pages 322\u2013335, 1990.","journal-title":"LNCS"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126, 1994.","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"34_CR4","first-page":"74","volume":"600","author":"R. Alur","year":"1991","unstructured":"R. Alur and T.A. Henzinger. Logics and models for real time: A survey. Real-Time:Theory in Practice, LNCS 600:pages 74\u2013106, 1991.","journal-title":"LNCS"},{"key":"34_CR5","first-page":"535","volume":"944","author":"J.H. Andersen","year":"1995","unstructured":"J.H. Andersen, K.J. Kristoffersen, K.G. Larsen, and J. Niedermann. Automatic synthesis of real time systems. Proc. of ICALP'95, LNCS 944:pages 535\u2013546, 1995.","journal-title":"LNCS"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"K. \u010der\u0101ns. Decidability of bisimulation equivalence for parallel timer processes. Proc. of CAV'92, LNCS 663, 1992.","DOI":"10.1007\/3-540-56496-9_24"},{"key":"34_CR7","unstructured":"A. Cheng and M. Nielsen. Open maps (at) work. Proc. of FST&TCS '95, LNCS 1026, 1996."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"T. Hune and M. Nielsen. Timed bisimulation and open maps. Technical Report RS-98-4, BRICS, 1998.","DOI":"10.7146\/brics.v5i4.19277"},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127,2:pages 164\u2013185, 1996.","journal-title":"Information and Computation"},{"key":"34_CR10","unstructured":"K.J. Kristoffersen and J. Niedermann. User's manual for Epsilon. Available via anonymous ftp at cs.auc.dk, December 1994."},{"key":"34_CR11","first-page":"529","volume":"969","author":"F. Laroussinie","year":"1995","unstructured":"F. Laroussinie, K. G. Larsen, and C. Weise. From timed automata to logic-and back. Proc. of MFCS'95, LNCS 969:pages 529\u2013539, 1995.","journal-title":"LNCS"},{"key":"34_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science, 1989."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01178579","volume":"30","author":"X. Nicollin","year":"1993","unstructured":"X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Acta Informatica, 30:pages 181\u2013202, 1993.","journal-title":"Acta Informatica"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Y. Wang. Real-time behaviour of asynchronous agents. Proc. of CONCUR'90, LNCS 458, 1990.","DOI":"10.1007\/BFb0039080"},{"key":"34_CR15","first-page":"177","volume":"1200","author":"C. Weise","year":"1997","unstructured":"C. Weise and D. Lenzkes. Efficient scaling-invariant checking of timed bisimulation. Proc. of STACS'97, LNCS 1200:pages 177\u2013188, 1997.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T13:49:51Z","timestamp":1627739391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0055787","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}