{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:09:51Z","timestamp":1648584591029},"reference-count":45,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0304-3975(90)90117-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"97-129","source":"Crossref","is-referenced-by-count":2,"title":["Transformations of sequential specifications into concurrent specifications by synchronization guards"],"prefix":"10.1016","volume":"77","author":[{"given":"Ryszard","family":"Janicki","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"M\u00fcldner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90117-Z_BIB1","first-page":"199","article-title":"A Method for Refining Atomicity in Parallel Algorithms","volume":"366","author":"Back","year":"1989"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB2","first-page":"416","article-title":"COSY: Its Relation to Nets and CSP","volume":"255","author":"Best","year":"1986"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB3","series-title":"Simula Begin","author":"Birtwistle","year":"1979"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB4","first-page":"63","article-title":"Heuristic rule-based transformations for enhanced vectorization","volume":"Vol II","author":"Bose","year":"1988"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB5","series-title":"Operating System Principles","author":"Hansen","year":"1973"},{"issue":"1","key":"10.1016\/0304-3975(90)90117-Z_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/spe.4380170105","article-title":"Joyce\u2014a programming language for distributed systems","volume":"17","author":"Hansen","year":"1987","journal-title":"Software Practice and Experience"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB7","article-title":"Problemes Combinatoires de Commutation et Rearrangements","volume":"85","author":"Cartier","year":"1969"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB8","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1002\/spe.4380141006","article-title":"An experiment in language design for distributed systems","volume":"14","author":"Crookes","year":"1984","journal-title":"Software Practice and Experience"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB9","first-page":"114","article-title":"Finding large-grain parallelism in loops with serial control dependencies","volume":"Vol II","author":"Dietz","year":"1988"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","article-title":"Hierarchical ordering of sequential process","volume":"1","author":"Dijkstra","year":"1971","journal-title":"Acta Inform"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemas, recursion schemas, and formal languages","volume":"7","author":"Garland","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB12","article-title":"Experiments in MIMD Parallelism","volume":"366","author":"Hey","year":"1989"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB13","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB14","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/947923.947931","article-title":"A short introduction to concurrent Euclid","volume":"17","author":"Holt","year":"1982","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB15","series-title":"occam Programming Manual","year":"1982"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB16","first-page":"327","article-title":"A Construction of Concurrent Systems by means of Sequential Solutions and Concurrency Relations","volume":"107","author":"Janicki","year":"1981"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB17","series-title":"Proc. 2nd. Conf. on Distributed Computing Systems","first-page":"455","article-title":"On the design of concurrent systems","author":"Janicki","year":"1981"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB18","first-page":"155","article-title":"A Method for Developing Concurrent Systems","volume":"167","author":"Janicki","year":"1984"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(85)90029-5","article-title":"Transforming sequential systems into concurrent systems","volume":"36","author":"Janicki","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB20","article-title":"How to relieve a programmer from synchronization details","author":"Janicki","year":"1988","journal-title":"Proc. 16th Ann. ACM Computer Science Conf."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB21","article-title":"Sequential specifications and concurrent executions of Banach programs","author":"Janicki","year":"1988","journal-title":"CIPS' 88"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB22","article-title":"Complete sequential specifications allows for a concurrent execution","author":"Janicki","year":"1989","journal-title":"ACM 1989 Computer Science Conf."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB23","article-title":"On algebraic transformations of sequential specifications","author":"Janicki","year":"1989","journal-title":"AMAST 89"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB24","doi-asserted-by":"crossref","DOI":"10.1145\/100348.100371","article-title":"A simple realization of parallel devices recognizing regularly defined trace languages","author":"Janicki","year":"1990","journal-title":"ACM 1990 Computer Science, Conf."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB25","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0304-3975(86)90177-5","article-title":"Concurrent and maximally concurrent evolution of non-sequential systems","volume":"43","author":"Janicki","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB26","series-title":"Specifications and Analysis of Concurrent Systems: The COSY Approach","author":"Janicki","year":"1990"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB27","first-page":"736","article-title":"CSP\/80: A language for communicating sequential processes","author":"Jazayeri","year":"1980","journal-title":"IEEE Compcon"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB28","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/358818.358824","article-title":"Experience with processes and monitors in Mesa","volume":"23","author":"Lampson","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB30","series-title":"Distributed Systems Programs","first-page":"107","article-title":"The COSY approach to distributed computing systems","author":"Lauer","year":"1984"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB31","series-title":"Concurrency and Nets","first-page":"287","article-title":"An introduction to the MACRO COSY notation","author":"Lauer","year":"1987"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6423(82)90003-X","article-title":"A methodology for programming concurrency: the formalism","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Comput. Programm."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(82)90002-8","article-title":"A methodology for programming concurrency: an informal approach","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Comput. Programm"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB34","first-page":"799","article-title":"Recursive algorithms and formal languages","volume":"20","author":"Mazurkiewicz","year":"1972","journal-title":"Bull. Acad. Polon. Sci. Ser. Math. Astronom. Phys."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB35","series-title":"Report DAIMI-PB-78","article-title":"Concurrent program schema and their interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB36","first-page":"297","article-title":"Trace Theory","volume":"255","author":"Mazurkiewicz","year":"1986"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB37","article-title":"Sequential specification of the dining philosophers problem","author":"M\u00fcldner","year":"1989","journal-title":"APICS'89 Computer Science Conf."},{"key":"10.1016\/0304-3975(90)90117-Z_BIB38","series-title":"Guide to Parallel Programming on Sequent Computer Systems","author":"Osterhaug","year":"1986"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB39","series-title":"Petri Nets","author":"Reisig","year":"1985"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB40","series-title":"Reference Manual for the Ada Programming Language","year":"1982"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB41","first-page":"58","article-title":"FAT\u2014An interactive Fortran parallelizing tool","volume":"Vol II","author":"Smith","year":"1988"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB42","first-page":"249","article-title":"Adequate Path Expressions","volume":"70","author":"Shields","year":"1979"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB43","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","article-title":"Concurrent machines","volume":"25","author":"Shields","year":"1985","journal-title":"The Computer Journal"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB44","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1002\/spe.4380091109","article-title":"Pascal-Plus\u2014another language for modular multiprogramming","volume":"9","author":"Welsh","year":"1979","journal-title":"Software Practice and Experience"},{"key":"10.1016\/0304-3975(90)90117-Z_BIB45","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/spe.4380070102","article-title":"Modula\u2014a language for modular multiprogramming","volume":"7","author":"Wirth","year":"1977","journal-title":"Software Practice and Experience"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090117Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090117Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:33Z","timestamp":1555127553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090117Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["030439759090117Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90117-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}