{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:02:22Z","timestamp":1746244942580,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548611"},{"type":"electronic","value":"9783642548628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54862-8_20","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:33:34Z","timestamp":1395408814000},"page":"295-309","source":"Crossref","is-referenced-by-count":4,"title":["Quasi-Equal Clock Reduction: More Networks, More Queries"],"prefix":"10.1007","author":[{"given":"Christian","family":"Herrera","sequence":"first","affiliation":[]},{"given":"Bernd","family":"Westphal","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Rappaport, T.S.: Wireless communications, vol.\u00a02. Prentice Hall (2002)"},{"issue":"3","key":"20_CR2","first-page":"566","volume":"31","author":"G. Cena","year":"2009","unstructured":"Cena, G., Seno, L., et al.: Performance analysis of ethernet powerlink networks for distributed control and automation systems. CSI\u00a031(3), 566\u2013572 (2009)","journal-title":"CSI"},{"issue":"2","key":"20_CR3","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\u00a0126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"20_CR4","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.\u00a07595, pp. 155\u2013170. Springer, Heidelberg (2012)"},{"key":"20_CR5","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.\u00a03185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"20_CR6","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":"20_CR7","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":"20_CR8","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.\u00a01384, pp. 313\u2013329. Springer, Heidelberg (1998)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, \u00c9.: Dynamic clock elimination in parametric timed automata. In: FSFMA, OASICS, pp. 18\u201331, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)","DOI":"10.1002\/9781118569351.ch1"},{"key":"20_CR10","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.\u00a05813, pp. 58\u201372. Springer, Heidelberg (2009)"},{"key":"20_CR11","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":"V.A. 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.\u00a02280, pp. 21\u201336. Springer, Heidelberg (2002)"},{"key":"20_CR12","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.\u00a07595, pp. 188\u2013203. Springer, Heidelberg (2012)"},{"key":"20_CR13","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.\u00a07454, pp. 100\u2013114. Springer, Heidelberg (2012)"},{"key":"20_CR14","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.\u00a08053, pp. 198\u2013212. Springer, Heidelberg (2013)"},{"key":"20_CR15","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":"20_CR16","unstructured":"Fitriani, K.: FraTTA: Framework for transformation of timed automata, Master Team Project, Albert-Ludwigs-Universit\u00e4t Freiburg (2013)"},{"key":"20_CR17","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":"20_CR18","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":"20_CR19","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":"20_CR20","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":"20_CR21","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.\u00a020, pp. 49\u201362 (2009)","DOI":"10.4204\/EPTCS.20.5"},{"key":"20_CR22","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.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54862-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:47:00Z","timestamp":1746157620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54862-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548611","9783642548628"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54862-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}