{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:30:18Z","timestamp":1768001418475,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319572871","type":"print"},{"value":"9783319572888","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57288-8_4","type":"book-chapter","created":{"date-parts":[[2017,4,8]],"date-time":"2017-04-08T02:45:05Z","timestamp":1491619505000},"page":"52-67","source":"Crossref","is-referenced-by-count":6,"title":["Multi-timed Bisimulation for Distributed Timed Automata"],"prefix":"10.1007","author":[{"given":"James","family":"Ortiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moussa","family":"Amrani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Yves","family":"Schobbens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,9]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-85361-9_10","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S Akshay","year":"2008","unstructured":"Akshay, S., Bollig, B., Gastin, P., Mukund, M., Narayan Kumar, K.: Distributed timed automata with independently evolving clocks. In: Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 82\u201397. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85361-9_10"},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-32940-1_9","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"S Balaguer","year":"2012","unstructured":"Balaguer, S., Chatain, T.: Avoiding shared clocks in networks of timed automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 100\u2013114. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32940-1_9"},{"issue":"3","key":"4_CR4","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/s10009-005-0190-0","volume":"8","author":"G Behrmann","year":"2006","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone-based abstractions of timed automata. STTT 8(3), 204\u2013215 (2006)","journal-title":"STTT"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-27755-2_3"},{"issue":"4","key":"4_CR6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/S1571-0661(05)80390-1","volume":"68","author":"S Blom","year":"2002","unstructured":"Blom, S., Orzan, S.: A distributed algorithm for strong bisimulation reduction of state spaces. Electr. Notes Theor. Comput. Sci. 68(4), 523\u2013538 (2002)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"3","key":"4_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Form. Methods Syst. Des. 24(3), 281\u2013320 (2004)","journal-title":"Form. Methods Syst. Des."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-04368-0_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bulychev","year":"2009","unstructured":"Bulychev, P., Chatain, T., David, A., Larsen, K.G.: Efficient on-the-fly algorithm for checking alternating timed simulation. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 73\u201387. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04368-0_8"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 302\u2013315. Springer, Heidelberg (1993). doi: 10.1007\/3-540-56496-9_24"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"De Biasi, M., Snickars, C., Landern\u00e4s, K., Isaksson, A.: Simulation of process control with WirelessHART networks subject to clock drift. In: COMPSAC (2008)","DOI":"10.1109\/COMPSAC.2008.163"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Krishnan, P.: Distributed timed automata. In: Workshop on Distributed Systems (1999)","DOI":"10.1016\/S1571-0661(05)80627-9"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-60246-1_158","volume-title":"Mathematical Foundations of Computer Science 1995","author":"F Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G., Weise, C.: From timed automata to logic \u2014 and back. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 529\u2013539. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60246-1_158"},{"key":"4_CR13","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Monot, A., Navet, N., Bavoux, B.: Impact of clock drifts on CAN frame response time distributions. In: ETFA, Toulouse, France (2011)","DOI":"10.1109\/ETFA.2011.6059186"},{"key":"4_CR15","unstructured":"Ortiz, J., Schobbens, P.-Y.: Extending timed bisimulation for distributed timed systems. Technical report, University of Namur (2016). http:\/\/www.info.fundp.ac.be\/~jor\/Multi-TimedReport\/"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-22256-6_23","volume-title":"Implementation and Application of Automata","author":"J Ortiz","year":"2011","unstructured":"Ortiz, J., Legay, A., Schobbens, P.-Y.: Distributed event clock automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 250\u2013263. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22256-6_23"},{"issue":"6","key":"4_CR17","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0055349","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"A Puri","year":"1998","unstructured":"Puri, A.: Dynamical properties of timed automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, pp. 210\u2013227. Springer, Heidelberg (1998). doi: 10.1007\/BFb0055349"},{"issue":"1","key":"4_CR19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1008734703554","volume":"18","author":"S Tripakis","year":"2001","unstructured":"Tripakis, S., Yovine, S.: Analysis of timed systems using time-abstracting bisimulations. Form. Methods Syst. Des. 18(1), 25\u201368 (2001)","journal-title":"Form. Methods Syst. Des."},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BFb0023458","volume-title":"STACS 97","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. 1200, pp. 177\u2013188. Springer, Heidelberg (1997). doi: 10.1007\/BFb0023458"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57288-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T01:32:24Z","timestamp":1601861544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57288-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319572871","9783319572888"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57288-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}