{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:11:05Z","timestamp":1751429465631,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"1,2,3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.3233\/fi-1994-201238","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T01:25:32Z","timestamp":1575336332000},"page":"231-275","source":"Crossref","is-referenced-by-count":2,"title":["COMPOSITIONAL PROOFS FOR NETWORKS OF PROCESSES"],"prefix":"10.1177","volume":"20","author":[{"given":"B.A.","family":"Trakhtenbrot","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel Aviv University, Ramat Aviv 69978, Israel"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-1994-201238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:56:16Z","timestamp":1751367376000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-1994-201238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":0,"journal-issue":{"issue":"1,2,3","published-print":{"date-parts":[[1994]]}},"URL":"https:\/\/doi.org\/10.3233\/fi-1994-201238","relation":{},"ISSN":["0169-2968"],"issn-type":[{"type":"print","value":"0169-2968"}],"subject":[],"published":{"date-parts":[[1994]]}}}