{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:46Z","timestamp":1725663166064},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_72","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:57:43Z","timestamp":1330203463000},"page":"249-258","source":"Crossref","is-referenced-by-count":0,"title":["System simulation and the sensitivity of self-stabilization"],"prefix":"10.1007","author":[{"given":"Mohamed G.","family":"Gouda","sequence":"first","affiliation":[]},{"given":"Rodney R.","family":"Howell","sequence":"additional","affiliation":[]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"G. Brown, M. Gouda, and C. Wu. Token systems that self-stabilize. 1989. IEEE Trans. on Computers, to appear.","DOI":"10.1109\/12.24293"},{"key":"20_CR2","unstructured":"J. Burns and J. Pachl. Uniform Self-Stabilizing Rings. Technical Report GIT-ICS-87\/33, School of Information and Computer Science, Georgia Institute of Technology, 1987."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1109\/32.6188","volume":"14","author":"F. Bastani","year":"1988","unstructured":"F. Bastani, I. Yen, and I. Chen. A class of inherently fault tolerant distributed programs. IEEE Trans. on Software Engineering, 14:1432\u20131442, 1988.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"D. Brand and P. Zafiropulo. On communicating finite-state machines. JACM, 30:323\u2013342, 1983.","journal-title":"JACM"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"H. Carstensen. Decidability questions for fairness in Petri nets. In Proceedings of the 4th Symposium on Theoretical Aspects of Computer Science, pages 396\u2013407, 1987. LNCS 247.","DOI":"10.1007\/BFb0039622"},{"key":"20_CR6","volume-title":"Numerical Mathematics and Computing","author":"W. Cheney","year":"1980","unstructured":"W. Cheney and D. Kincaid. Numerical Mathematics and Computing. Brooks\/Cole, Monterey, Cal., 1980."},{"key":"20_CR7","first-page":"41","volume-title":"EWD391 Self-stabilization in spite of distributed control. 1973","author":"E. Dijkstra","year":"1982","unstructured":"E. Dijkstra. EWD391 Self-stabilization in spite of distributed control. 1973. Reprinted in Selected Writings on Computing: A Personal Perspective, Springer-Verlag, Berlin, 1982, pp. 41\u201346."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. Dijkstra","year":"1974","unstructured":"E. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the ACM, 17:643\u2013644, 1974.","journal-title":"Communications of the ACM"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"E. Emerson","year":"1987","unstructured":"E. Emerson and C. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8:275\u2013306, 1987.","journal-title":"Science of Computer Programming"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"M. Gouda, R. Howell, and L. Rosier. The instability of self-stabilization. In preparation, 1989.","DOI":"10.1007\/BF00264283"},{"key":"20_CR11","unstructured":"M. Gouda. The Stabilizing Philosopher: Asymmetry by Memory and by Action. Technical Report TR-87-12, Dept. of Computer Sciences, University of Texas at Austin, 1987."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. Hoare","year":"1978","unstructured":"C. Hoare. Communicating sequential processes. Communications of the ACM, 21:666\u2013677, 1978.","journal-title":"Communications of the ACM"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoret. Comp. Sci., 8:135\u2013159, 1979.","journal-title":"Theoret. Comp. Sci."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"R. Howell, L. Rosier, and H. Yen. A taxonomy of fairness and temporal logic problems for Petri nets. In Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science, pages 351\u2013359, 1988. To appear in Theoret. Comp. Sci.","DOI":"10.1007\/BFb0017158"},{"key":"20_CR15","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979."},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/0214033","volume":"14","author":"O. Ibarra","year":"1985","unstructured":"O. Ibarra, S. Kim, and S. Moran. Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Computing, 14:426\u2013447, 1985.","journal-title":"SIAM J. Computing"},{"key":"20_CR17","unstructured":"R.M. Keller. Vector Replacement Systems: A Formalism for Modelling Asynchronous Systems. TR 117, Princeton University, CSL, 1972."},{"key":"20_CR18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. Karp","year":"1969","unstructured":"R. Karp and R. Miller. Parallel program schemata. J. of Computer and System Sciences, 3:147\u2013195, 1969.","journal-title":"J. of Computer and System Sciences"},{"key":"20_CR19","volume-title":"Theorie der Endlichen und Unendlichen Graphen","author":"D. K\u00f6nig","year":"1936","unstructured":"D. K\u00f6nig. Theorie der Endlichen und Unendlichen Graphen. Akademische Verlagsgesellschaft, Leipzig, 1936."},{"key":"20_CR20","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/T-C.1974.223995","volume":"C-23","author":"S. Kosaraju","year":"1974","unstructured":"S. Kosaraju. On some open problems in the theory of cellular automata. IEEE Trans. on Computers, C-23:561\u2013565, 1974.","journal-title":"IEEE Trans. on Computers"},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"L. Lamport. The mutual exclusion problem: Part II \u2014 Statement and solutions. JACM, 33:327\u2013348, 1986.","journal-title":"JACM"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"D. Lehman and M. Rabin. On the advantages of free choice: A symmetric and fully distributed solution of the dining philosophers problem. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, pages 133\u2013138, 1981.","DOI":"10.1145\/567532.567547"},{"key":"20_CR23","unstructured":"N. Multari. Self-stabilizing Protocols. PhD thesis, Dept. of Computer Sciences, University of Texas at Austin, 1989. In preparation."},{"key":"20_CR24","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. Owicki","year":"1982","unstructured":"S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM Trans. on Programming Languages and Syst., 4:455\u2013495, 1982.","journal-title":"ACM Trans. on Programming Languages and Syst."},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"C. \u00d6zveren, A. Willsky, and P. Antsaklis. Stability and stabilizability of discrete event dynamic systems. MIT LIDS Publication, LIDS-P-1853, 1989.","DOI":"10.21236\/ADA459490"},{"key":"20_CR26","volume-title":"Petri Net Theory and the Modeling of Systems","author":"J. Peterson","year":"1981","unstructured":"J. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs, NJ, 1981."},{"key":"20_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W. Reisig","year":"1985","unstructured":"W. Reisig. Petri Nets: An Introduction. Springer-Verlag, Heidelberg, 1985."},{"key":"20_CR28","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/S0019-9958(71)90501-8","volume":"18","author":"A. Smith","year":"1971","unstructured":"A. Smith. Cellular automata complexity tradeoffs. Information and Control, 18:466\u2013482, 1971.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:25Z","timestamp":1605648085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}