{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:51:51Z","timestamp":1742381511752},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402289"},{"type":"electronic","value":"9783642402296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40229-6_6","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:47:40Z","timestamp":1374529660000},"page":"77-90","source":"Crossref","is-referenced-by-count":5,"title":["Transience Bounds for Distributed Algorithms"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"F\u00fcgger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/377\/06984","volume-title":"Idempotent Mathematics and Mathematical Physics","author":"M. Akian","year":"2005","unstructured":"Akian, M., Gaubert, S., Walsh, C.: Discrete Max-Plus Spectral Theory. In: Litvinov, G.L., Maslov, V.P. (eds.) Idempotent Mathematics and Mathematical Physics, pp. 53\u201378. AMS, Providence (2005)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-16023-3_33","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"H. Attiya","year":"2010","unstructured":"Attiya, H., Gramoli, V., Milani, A.: A Provably Starvation-Free Distributed Directory Protocol. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 405\u2013419. Springer, Heidelberg (2010)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of Network Synchronization. J. ACM\u00a032, 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V.C. Barbosa","year":"1989","unstructured":"Barbosa, V.C., Gafni, E.: Concurrency in Heavily Loaded Neighborhood-Constrained Systems. ACM T. Progr. Lang. Sys.\u00a011, 562\u2013584 (1989)","journal-title":"ACM T. Progr. Lang. Sys."},{"key":"6_CR5","volume-title":"Workshop on Max-Plus Algebra at the 1st IFAC Symposium on System Structure and Control","author":"A. Bouillard","year":"2001","unstructured":"Bouillard, A., Gaujal, B.: Coupling Time of a (max,plus) Matrix. In: Workshop on Max-Plus Algebra at the 1st IFAC Symposium on System Structure and Control. Elsevier, Amsterdam (2001)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/S0097539704443598","volume":"35","author":"C. Busch","year":"2005","unstructured":"Busch, C., Tirthapura, S.: Analysis of Link Reversal Routing Algorithms. SIAM J. Comput.\u00a035, 305\u2013326 (2005)","journal-title":"SIAM J. Comput."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The Drinking Philosophers Problem. ACM T. Progr. Lang. Sys.\u00a06, 632\u2013646 (1984)","journal-title":"ACM T. Progr. Lang. Sys."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: New Transience Bounds for Long Walks (2012) arXiv:1209.3342 [cs.DM]","DOI":"10.1007\/978-88-7642-475-5_103"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-22212-2_10","volume-title":"Structural Information and Communication Complexity","author":"B. Charron-Bost","year":"2011","unstructured":"Charron-Bost, B., F\u00fcgger, M., Welch, J.L., Widder, J.: Full Reversal Routing as a Linear Dynamical System. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 101\u2013112. Springer, Heidelberg (2011)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-22212-2_11","volume-title":"Structural Information and Communication Complexity","author":"B. Charron-Bost","year":"2011","unstructured":"Charron-Bost, B., F\u00fcgger, M., Welch, J.L., Widder, J.: Partial is Full. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 113\u2013124. Springer, Heidelberg (2011)"},{"key":"6_CR11","unstructured":"Cohen, G., Dubois, D., Quadrat, J.-P., Viot, M.: Analyse du comportement p\u00e9riodique de syst\u00e8mes de production par la th\u00e9orie des dio\u00efdes. INRIA Research Report 191 (1983)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02248590","volume":"26","author":"D. Dubois","year":"1990","unstructured":"Dubois, D., Stecke, K.E.: Dynamic Analysis of Repetitive Decision-Free Discrete Event Processes: The Algebra of Timed Marked Graphs and Algorithmic Issues. Ann. Oper. Res.\u00a026, 151\u2013193 (1990)","journal-title":"Ann. Oper. Res."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF02679457","volume":"30","author":"S. Even","year":"1997","unstructured":"Even, S., Rajsbaum, S.: The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Systems. Theor. Comput. Syst.\u00a030, 447\u2013474 (1997)","journal-title":"Theor. Comput. Syst."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/TIT.1987.1057274","volume":"33","author":"E.M. Gafni","year":"1987","unstructured":"Gafni, E.M., Bertsekas, D.P.: Asymptotic Optimality of Shortest Path Routing Algorithms. IEEE T. Inform. Theory.\u00a033, 83\u201390 (1987)","journal-title":"IEEE T. Inform. Theory."},{"key":"6_CR15","doi-asserted-by":"crossref","DOI":"10.1515\/9781400865239","volume-title":"Max Plus at Work","author":"B. Heidergott","year":"2006","unstructured":"Heidergott, B., Olsder, G.J., van der Woude, J.: Max Plus at Work. Princeton University Press, Princeton (2006)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0022451","volume-title":"Distributed Algorithms","author":"Y. Malka","year":"1992","unstructured":"Malka, Y., Rajsbaum, S.: Analysis of Distributed Algorithms Based on Recurrence Relations. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds.) WDAG 1991. LNCS, vol.\u00a0579, pp. 242\u2013253. Springer, Heidelberg (1992)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.24.2.414","volume":"24","author":"M. Hartmann","year":"1999","unstructured":"Hartmann, M., Arguelles, C.: Transience Bounds for Long Walks. Math. Oper. Res.\u00a024, 414\u2013439 (1999)","journal-title":"Math. Oper. Res."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01199464","volume":"46","author":"K. Nachtigall","year":"1997","unstructured":"Nachtigall, K.: Powers of Matrices over an Extremal Algebra with Applications to Periodic Graphs. Math. Method. Oper. Res.\u00a046, 87\u2013102 (1997)","journal-title":"Math. Method. Oper. Res."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/moor.16.1.208","volume":"16","author":"H. Schneider","year":"1991","unstructured":"Schneider, H., Schneider, M.H.: Max-Balancing Weighted Directed Graphs and Matrix Scaling. Math. Oper. Res.\u00a016, 208\u2013222 (1991)","journal-title":"Math. Oper. Res."},{"key":"6_CR20","unstructured":"Soto y Koelemeijer, G.: On the Behaviour of Classes of Min-Max-Plus Systems. PhD Thesis, TU Delft (2003)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/TPDS.2006.94","volume":"17","author":"S. Tirthapura","year":"2006","unstructured":"Tirthapura, S., Herlihy, M.: Self-Stabilizing Distributed Queuing. IEEE T. Parall. Distr.\u00a017, 646\u2013655 (2006)","journal-title":"IEEE T. Parall. Distr."},{"key":"6_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02006-3","volume-title":"Link Reversal Algorithms","author":"J.L. Welch","year":"2012","unstructured":"Welch, J.L., Walter, J.E.: Link Reversal Algorithms. Morgan & Claypool, San Rafael (2012)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40229-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T07:08:11Z","timestamp":1688368091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40229-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402289","9783642402296"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40229-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}