{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:47:42Z","timestamp":1648579662777},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01178259","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T19:38:41Z","timestamp":1108669121000},"page":"189-207","source":"Crossref","is-referenced-by-count":2,"title":["Bounded self-stabilizing Petri nets"],"prefix":"10.1007","volume":"32","author":[{"given":"Ludmila","family":"Cherkasova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney R.","family":"Howell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/12.24293","volume":"38","author":"G. Brown","year":"1989","unstructured":"Brown, G., Gouda, M., Wu, C.: Token systems that self-stabilize. IEEE Trans. Comput.38, 845?852 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/63264.63403","volume":"11","author":"J. Burns","year":"1989","unstructured":"[BP89] Burns, J., Pachl, J.: Uniform self-stabilizing rings. ACM Trans. Programming Languages Systems11, 330?344 (1989)","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1109\/32.6188","volume":"14","author":"F. Bastani","year":"1988","unstructured":"[BYC88] Bastani, F., Yen, I., Chen, I.: A class of inherently fault tolerant distributed programs. IEEE Trans. Software Eng.14, 1432?1442 (1988)","journal-title":"IEEE Trans. Software Eng."},{"key":"CR4","first-page":"41","volume-title":"EWD391 Self-stabilization in spite of distributed control (1973)","author":"E. Dijkstra","year":"1982","unstructured":"Dijkstra, E.: EWD391 Self-stabilization in spite of distributed control (1973) Reprinted in Selected writings on computing:A personal perspective, pp. 41?46. Berlin: Springer 1982."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. Dijkstra","year":"1974","unstructured":"Dijkstra, E.: Self-stabilizing systems in spite of distributed control. Commun. ACM, 17, 643?644 (1974)","journal-title":"Commun. ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/BF00264283","volume":"27","author":"M. Gouda","year":"1990","unstructured":"Gouda, M., Howell, R., Rosier, L.: The instability of self-stabilization. Acta Inf.27, 697?724 (1990)","journal-title":"Acta Inf."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1006\/inco.1993.1055","volume":"80","author":"R. Howell","year":"1993","unstructured":"Howell, R., Jan?ar, P., Rosier, L.: Single-path Petri nets. Inform. and Comput.80, 253?265 (1993)","journal-title":"Inform. and Comput."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0190(91)90004-2","volume":"39","author":"R. Howell","year":"1991","unstructured":"Howell R.: The complexity of problems concerning structurally bounded and conservative Petri nets. Inform. Processing Lett.39, 309?315 (1991)","journal-title":"Inform. Processing Lett."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theoret. Comput. Sci.8, 135?159 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0022-0000(88)90013-X","volume":"37","author":"R. Howell","year":"1988","unstructured":"Howell, R., Rosier, L.: Completeness results for conflict-free vector replacement systems. J. Comput. System Sci.37, 349?366 (1988)","journal-title":"J. Comput. System Sci."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(87)90089-5","volume":"25","author":"R. Howell","year":"1987","unstructured":"Howell, R., Rosier, L., Yen, H.: An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systems. Inform. Process. Lett.25, 27?33 (1987)","journal-title":"Inform. Process. Lett."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-0000(93)90046-Y","volume":"46","author":"R. Howell","year":"1993","unstructured":"Howell, R., Rosier, L., Yen, H.: Normal and sinkless Petri nets. J. Comput. System Sci.46 1?26 (1993)","journal-title":"J. Comput. System Sci."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N. Jones","year":"1977","unstructured":"Jones, N., Laaser, W.: Complete problems for deterministic polynomial time. Theoret. Comput. Sci.3, 105?117 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"N. Jones","year":"1977","unstructured":"Jones, N., Landweber, L., Lien, Y.: Complexity of some problems in Petri nets. Theoret. Comput. Sci.4, 277?299 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds) Complexity of computer computations, pp. 85?103. New York: Plenum Press 1972."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica,4, 373?395 (1984)","journal-title":"Combinatorica"},{"key":"CR17","first-page":"1093","volume":"244","author":"L. Khachian","year":"1979","unstructured":"Khachian, L.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk. SSSR,244, 1093?1096 (1979) (in Russian). English translation in Soviet Math. Dokl.,20, 191?194.","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. Karp","year":"1969","unstructured":"Karp, R., Miller, R.: Parallel program schemata. J. Comput. System Sci3, 147?195 (1969)","journal-title":"J. Comput. System Sci"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Kosaraju, R.: Decidability of reachability in vector addition systems. In: Proc. 14th ACM Symp. on Theory of Computing, pages 267?280 (1982)","DOI":"10.1145\/800070.802201"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: Part II-Statement and solutions. JACM33, 327?348 (1986)","journal-title":"JACM"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J. Lambert","year":"1992","unstructured":"Lambert, J.: A structure to decide reachability in Petri nets. Theoret. Comput. Sci.99, 79?104 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"CR22","unstructured":"Lipton, R.: The reachability problem requires exponential space. Technical Report 62, Yale University, Dept. of CS., 1976."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM J. Comput.13, 441?460 (1984). A preliminary version of this paper was presented at the ?13th ACM Symp. on Theory of Computing? (1981).","journal-title":"SIAM J. Comput."},{"key":"CR24","unstructured":"Multari, N.: Self-stabilizing protocols. Ph.D. Thesis, Dept. of Computer Sciences, University of Texas at Austin, 1989."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"[Mur89] Murata, T.: Petri nets: properties, analysis, and applications. Proc. IEEE77, 541?580 (1989)","journal-title":"Proc. IEEE"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoret. Comput. Sci.6, 223?231 (1978)","journal-title":"Theoret. Comput. Sci."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. Savitch","year":"1970","unstructured":"Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. System Sci.4, 177?192 (1970)","journal-title":"J. Comput. System Sci."},{"key":"CR28","unstructured":"Silva, M.: Las Redes de Petri: en la Automatica y la Informatica. Editorial AC, Madrid, 1985. ISBN 84 7288 045 1."},{"key":"CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and optimization in finite dimensions I","author":"J. Stoer","year":"1970","unstructured":"Stoer, J., Witzgall, C.: Convexity and optimization in finite dimensions I. Berlin: Springer 1970."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178259.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178259\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:29:09Z","timestamp":1586118549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01178259"],"URL":"https:\/\/doi.org\/10.1007\/bf01178259","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}