{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:55Z","timestamp":1761611155804},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1007\/bf01294595","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T08:23:24Z","timestamp":1111739004000},"page":"41-65","source":"Crossref","is-referenced-by-count":19,"title":["Different local controls for graph relabeling systems"],"prefix":"10.1007","volume":"28","author":[{"given":"I.","family":"Litovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"M\ufffdtivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Sopena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Lecture Notes in Computer Science, Vol. 190","author":"M. W. Alford","year":"1985","unstructured":"M. W. Alford, J. P. Ansart, G. Hommel, L. Lamport, B. Kiskov, G. P. Mullery, and F. B. Schneider,Distributed Systems, Lecture Notes in Computer Science, Vol. 190, Springer-Verlag, Berlin, 1985."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"D. Angluin, Local and global properties in networks of processors,Proceedings of the 12th Symposium on The Theory of Computing, 1980, pp. 82?93.","DOI":"10.1145\/800141.804655"},{"key":"CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1977","unstructured":"C. Berge,Graphs and Hypergraphs, North-Holland, Amsterdam, 1977."},{"key":"CR4","first-page":"94","volume-title":"Lecture Notes in Computer Science, Vol. 411","author":"M. Billaud","year":"1989","unstructured":"M. Billaud, P. Lafon, Y. M\u00e9tivier, and E. Sopena,Graph Rewriting Systems with Priorities, Lecture Notes in Computer Science, Vol. 411, Springer-Verlag, Berlin, 1989, pp. 94?106."},{"key":"CR5","first-page":"141","volume-title":"Tree Automata and Languages","author":"B. Courcelle","year":"1992","unstructured":"B. Courcelle, Recognizable sets of unrooted trees, inTree Automata and Languages, M. Nivat and A. Podelski (editors), Elsevier, Amsterdam, 1992, pp. 141?157."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"J. Dassow and G. Paun,Regulated Rewriting in Formal Language Theory, EATCS Series, Vol. 18, 1989.","DOI":"10.1007\/978-3-642-74932-2"},{"key":"CR7","volume-title":"Algorithmic Graph Theory","author":"A. Gibbons","year":"1985","unstructured":"A. Gibbons,Algorithmic Graph Theory, Cambridge University Press, Cambridge, 1985."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0095-8956(82)90042-9","volume":"33","author":"F. T. Leighton","year":"1982","unstructured":"F. T. Leighton, Finite common coverings of graphs,J. Combin. Theory Ser. B,33 (1982), 231?238.","journal-title":"J. Combin. Theory Ser. B"},{"key":"CR9","first-page":"549","volume-title":"Lecture Notes in Computer Science, Vol. 532","author":"I. Litovsky","year":"1991","unstructured":"I. Litovsky and Y. M\u00e9tivier, Computing with graph rewriting systems with priorities,Proceedings of the Fourth International Workshop on Graph Grammars and Their Applications to Computer Science, Bremen, Lecture Notes in Computer Science, Vol. 532, Springer-Verlag, Berlin, 1991, pp. 549?563."},{"key":"CR10","first-page":"115","volume-title":"Tree Automata and Languages","author":"I. Litovsky","year":"1992","unstructured":"I. Litovsky and Y. M\u00e9tivier, Computing trees with graph rewriting systems with priorities, inTree Automata and Languages, M. Nivat and A. Podelski (editors), Elsevier, Amsterdam, 1992, pp. 115?139."},{"key":"CR11","first-page":"333","volume-title":"Lecture Note in Computer Science, Vol. 657","author":"I. Litovsky","year":"1993","unstructured":"I. Litovsky, Y. M\u00e9tivier, and W. Zielonka, The power and limitations of local computations on graphs and networks,Proceedings of Graph-Theoretic Concepts in Computer Science (WG '92), Lecture Note in Computer Science, Vol. 657, Springer-Verlag, Berlin, 1993, pp. 333?345."},{"key":"CR12","unstructured":"A. Mazurkiewicz, Elections in planar graphs, Internal Report 190-105, University of Bordeaux, 1990."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294595.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01294595\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:56:36Z","timestamp":1586181396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01294595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["BF01294595"],"URL":"https:\/\/doi.org\/10.1007\/bf01294595","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}