{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:53:28Z","timestamp":1773615208677,"version":"3.50.1"},"reference-count":2,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.3103\/s0146411614070268","type":"journal-article","created":{"date-parts":[[2015,1,30]],"date-time":"2015-01-30T19:16:45Z","timestamp":1422645405000},"page":"615-622","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Primitive program schemata with procedures"],"prefix":"10.3103","volume":"48","author":[{"given":"R. I.","family":"Podlovchenko","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2015,2,1]]},"reference":[{"key":"6364_CR1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.18255\/1818-1015-2014-2-56-70","volume":"21","author":"RI Podlovchenko","year":"2014","unstructured":"Podlovchenko, R.I. and Molchanov, A.E., Equivalence problem solvability in gateway program model, Model. Analis Inform. Sist., 2014, vol. 21, pp. 56\u201370.","journal-title":"Model. Analis Inform. Sist."},{"key":"6364_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1134\/S0361768810030011","volume":"36","author":"RI Podlovchenko","year":"2010","unstructured":"Podlovchenko, R.I., Complete systems of equivalent transformations in balanced semigroup models of programs with left cancellation, Progr. Compt. Software, 2010, vol. 36, pp. 125\u2013137.","journal-title":"Progr. Compt. Software"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070268.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411614070268","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070268.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:56:52Z","timestamp":1773611812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411614070268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":2,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["6364"],"URL":"https:\/\/doi.org\/10.3103\/s0146411614070268","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]},"assertion":[{"value":"20 August 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}