{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:07:18Z","timestamp":1649153238142},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90067-j","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"289-294","source":"Crossref","is-referenced-by-count":4,"title":["Deriving graphical representations of process networks from algebraic expressions"],"prefix":"10.1016","volume":"46","author":[{"given":"T.","family":"Bolognesi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90067-J_BIB1","series-title":"Proc. 10th Internat. Conf. on Distributed Computing Systems","first-page":"88","article-title":"A graphical composition theorem for networks of LOTOS processes","author":"Bolognesi","year":"1990"},{"issue":"1","key":"10.1016\/0020-0190(93)90067-J_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","article-title":"Introduction to the ISO specification language LOTOS","volume":"14","author":"Bolognesi","year":"1987","journal-title":"Comput. Networks ISDN Systems"},{"key":"10.1016\/0020-0190(93)90067-J_BIB3","year":"1989","journal-title":"LOTOS \u2014 A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour"},{"key":"10.1016\/0020-0190(93)90067-J_BIB4","series-title":"Formal Description Techniques III","first-page":"443","article-title":"Process topology diagrams","author":"Hinterplattner","year":"1991"},{"key":"10.1016\/0020-0190(93)90067-J_BIB5","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"issue":"2","key":"10.1016\/0020-0190(93)90067-J_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/322123.322134","article-title":"Concurrent processes and their syntax","volume":"26","author":"Milne","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90067-J_BIB7","series-title":"ISO\/IECJTC 1\/SC 21 N. 4871","year":"1992"},{"key":"10.1016\/0020-0190(93)90067-J_BIB8","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"104","author":"Park","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390067J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390067J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T18:23:33Z","timestamp":1554920613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390067J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390067J"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90067-j","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}