{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:37:54Z","timestamp":1649176674885},"reference-count":20,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0141-9331(01)00123-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:20:16Z","timestamp":1027632016000},"page":"309-314","source":"Crossref","is-referenced-by-count":0,"title":["Reusing LOTOS specifications"],"prefix":"10.1016","volume":"25","author":[{"given":"Antonella","family":"Santone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gigliola","family":"Vaglini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0141-9331(01)00123-5_BIB1","series-title":"Selective mu-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems","author":"Barbuti","year":"1997"},{"issue":"3","key":"10.1016\/S0141-9331(01)00123-5_BIB2","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1006\/jcss.1999.1660","article-title":"Selective mu-calculus and formula-based abstractions of transition systems","volume":"59","author":"Barbuti","year":"1999","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB3","series-title":"Software Reusability Vol. 1: Concepts and Models","year":"1989"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","article-title":"Introduction to ISO Specification Language LOTOS","volume":"14","author":"Bolognesi","year":"1987","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB5","first-page":"207","article-title":"The integration Project for the JACK Environment","volume":"54","author":"Bouali","year":"1994","journal-title":"Bulletin of the EATCS"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite-state concurrent systems using temporal logic verification","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB7","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, S. Sims, The NCSU concurrency workbench, Proceedings of the Eighth International Conference on Computer-Aided Verification (CAV\u201996), Lecture Notes in Computer Science 1102, 1996, pp. 394\u2013397.","DOI":"10.1007\/3-540-61474-5_87"},{"issue":"3","key":"10.1016\/S0141-9331(01)00123-5_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","article-title":"Using branching time temporal logic to synthesize synchronization skeletons","volume":"2","author":"Emerson","year":"1982","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB9","doi-asserted-by":"crossref","unstructured":"J.J. Jeng, B.H.C. Cheng, Specification matching for software reuse: a foundation, Proceedings of the ACM SIGSOFT Symposium on software Reusability (SSR '95), 1995, pp. 97\u2013105.","DOI":"10.1145\/211782.211817"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional mu-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S0141-9331(01)00123-5_BIB11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/130844.130856","article-title":"Software reuse","volume":"24","author":"Krueger","year":"1992","journal-title":"ACM Computer Survey"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB13","series-title":"Equation Solving Using Modal Transition Systems","author":"Larsen","year":"1990"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB14","doi-asserted-by":"crossref","unstructured":"O. Maler, A. Pnueli, J. Sifakis, On the synthesis of discrete controllers for timed systems, Proceedings of 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS'95), Lecture Notes in Computer Science 900, 1995, pp. 229\u2013242.","DOI":"10.1007\/3-540-59042-0_76"},{"issue":"1","key":"10.1016\/S0141-9331(01)00123-5_BIB15","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","article-title":"Synthesis of communicating processes from temporal logic specifications","volume":"6","author":"Manna","year":"1984","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB16","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"2","key":"10.1016\/S0141-9331(01)00123-5_BIB17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(89)90128-X","article-title":"Submodule construction as equation solving in CCS","volume":"68","author":"Parrow","year":"1989","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S0141-9331(01)00123-5_BIB18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/75277.75293","article-title":"On the synthesis of a reactive module","volume":"24","author":"Pnueli","year":"1989","journal-title":"Proceedings of ACM Symposium POPL'89"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB19","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","article-title":"Supervisory control of a class of discrete event processes","volume":"25","author":"Ramadge","year":"1987","journal-title":"SIAM Journal of Control and Optimization"},{"key":"10.1016\/S0141-9331(01)00123-5_BIB20","unstructured":"A. Santone, G. Vaglini, Reusing software components by means of automatable formula-based integrations, Technical Report PI-DII\/7 2000, July 2000."},{"key":"10.1016\/S0141-9331(01)00123-5_BIB21","doi-asserted-by":"crossref","unstructured":"C. Stirling, An introduction to modal and temporal logics for CCS, Concurrency: Theory, Language, and Architecture, Lecture Notes in Computer Science 391, 1989.","DOI":"10.1007\/BFb0013039"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933101001235?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933101001235?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T02:25:24Z","timestamp":1620786324000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0141933101001235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0141933101001235"],"URL":"https:\/\/doi.org\/10.1016\/s0141-9331(01)00123-5","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}