{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:07:01Z","timestamp":1748750821713,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319262864"},{"type":"electronic","value":"9783319262871"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26287-1_11","type":"book-chapter","created":{"date-parts":[[2015,10,26]],"date-time":"2015-10-26T05:44:58Z","timestamp":1445838298000},"page":"173-189","source":"Crossref","is-referenced-by-count":2,"title":["Quasi-equal Clock Reduction: Eliminating Assumptions on Networks"],"prefix":"10.1007","author":[{"given":"Christian","family":"Herrera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Westphal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"issue":"2","key":"11_CR1","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.: A theory of timed automata. TCS 126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-33365-1_12","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"C Herrera","year":"2012","unstructured":"Herrera, C., Westphal, B., Feo-Arenis, S., Mu\u00f1iz, M., Podelski, A.: Reducing quasi-equal clocks in networks of timed automata. In: Jurdzi\u0144ski, M., Ni\u010dkovi\u0107, D. (eds.) FORMATS 2012. LNCS, vol. 7595, pp. 155\u2013170. Springer, Heidelberg (2012)"},{"key":"11_CR3","unstructured":"Rappaport, T.S.: Wireless communications, vol. 2. Prentice Hall (2002)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-54862-8_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Herrera","year":"2014","unstructured":"Herrera, C., Westphal, B., Podelski, A.: Quasi-equal clock reduction: more networks, more queries. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 295\u2013309. Springer, Heidelberg (2014)"},{"key":"11_CR6","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":"JE Bengtsson","year":"2004","unstructured":"Bengtsson, J.E., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"issue":"5","key":"11_CR7","first-page":"655","volume":"28","author":"N Petalidis","year":"2009","unstructured":"Petalidis, N.: Verification of a fieldbus scheduling protocol using timed automata. CI 28(5), 655\u2013672 (2009)","journal-title":"CI"},{"key":"11_CR8","unstructured":"Godary, K.: Validation temporelle de r\u00e9seaux embarqu\u00e9s critiques et fiables pour l\u2019automobile. PhD thesis, Institut National des Sciences Appliqu\u00e9es de Lyon, France (2004)"},{"issue":"14","key":"11_CR9","doi-asserted-by":"publisher","first-page":"2773","DOI":"10.1080\/00207540410001705220","volume":"42","author":"B B\u00e9rard","year":"2004","unstructured":"B\u00e9rard, B., Bouyer, P., Petit, A.: Analysing the PGM Protocol with UPPAAL. IJPR 42(14), 2773\u20132791 (2004)","journal-title":"IJPR"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Daws, C., Yovine, S.: Reducing the number of clock variables of timed automata. In: RTSS, pp. 73\u201381. IEEE (1996)","DOI":"10.1109\/REAL.1996.563702"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 313\u2013329. Springer, Heidelberg (1998)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-04368-0_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"V Braberman","year":"2009","unstructured":"Braberman, V., Garbervestky, D., Kicillof, N., Monteverde, D., Olivero, A.: Speeding up model checking of timed-models by combining scenario specialization and live component analysis. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 58\u201372. Springer, Heidelberg (2009)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-46002-0_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"VA Braberman","year":"2002","unstructured":"Braberman, V.A., Garbervetsky, D., Olivero, A.: Improving the verification of timed systems using influence information. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, p. 21. Springer, Heidelberg (2002)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Limal, S., Potier, S., Denis, B., Lesage, J.: Formal verification of redundant media extension of ethernet powerlink. In: ETFA, pp. 1045\u20131052. IEEE (2007)","DOI":"10.1109\/EFTA.2007.4416898"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-33365-1_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Mu\u00f1iz","year":"2012","unstructured":"Mu\u00f1iz, M., Westphal, B., Podelski, A.: Timed automata with disjoint activity. In: Jurdzi\u0144ski, M., Ni\u010dkovi\u0107, D. (eds.) FORMATS 2012. LNCS, vol. 7595, pp. 188\u2013203. Springer, Heidelberg (2012)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-40229-6_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Mu\u00f1iz","year":"2013","unstructured":"Mu\u00f1iz, M., Westphal, B., Podelski, A.: Detecting quasi-equal clocks in timed automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 198\u2013212. Springer, Heidelberg (2013)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Olderog, E.-R., Dierks, H.: Real-time systems - formal specification and automatic verification. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511619953"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Dietsch, D., Feo-Arenis, S., et al.: Disambiguation of industrial standards through formalization and graphical languages. In: RE, pp. 265\u2013270. IEEE (2011)","DOI":"10.1109\/RE.2011.6051634"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Gobriel, S., Khattab, S., Moss\u00e9, D., et al.: RideSharing: fault tolerant aggregation in sensor networks using corrective actions. In: SECON, pp. 595\u2013604. IEEE (2006)","DOI":"10.1109\/SAHCN.2006.288516"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Jensen, H., Larsen, K., Skou, A.: Modelling and analysis of a collision avoidance protocol using SPIN and Uppaal. In: 2nd SPIN Workshop (1996)","DOI":"10.7146\/brics.v3i24.20005"},{"key":"11_CR21","unstructured":"Steiner, W., Elmenreich, W.: Automatic recovery of the TTP\/A sensor\/actuator network. In: WISES, pp. 25\u201337. Vienna University of Technology (2003)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kordy, P., Langerak, R., et al.: Re-verification of a lip synchronization protocol using robust reachability. In: FMA. EPTCS, vol. 20, pp. 49\u201362 (2009)","DOI":"10.4204\/EPTCS.20.5"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software: Verification and Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26287-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:12:59Z","timestamp":1748664779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26287-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319262864","9783319262871"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26287-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}