{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:14:08Z","timestamp":1648725248934},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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":[[1998,3]]},"DOI":"10.1016\/s0304-3975(97)00025-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"183-205","source":"Crossref","is-referenced-by-count":3,"title":["Resolution-based approach to compatibility analysis of interacting automata"],"prefix":"10.1016","volume":"194","author":[{"given":"Anatoli N.","family":"Chebotarev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina K.","family":"Morokhovets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00025-X_BIB1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","article-title":"The existence of refinement mapping","volume":"82","author":"Abadi","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00025-X_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/151646.151649","article-title":"Composing specifications","volume":"15","author":"Abadi","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite-state machines","volume":"30","author":"Brand","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB4","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB5","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1007\/BF01246512","article-title":"Interacting automata","volume":"27","author":"Chebotarev","year":"1991","journal-title":"Cybernet. Systems Anal."},{"key":"10.1016\/S0304-3975(97)00025-X_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02366789","article-title":"Determinations of logical specifications of automata","volume":"31","author":"Chebotarev","year":"1995","journal-title":"Cybernet. Systems Anal."},{"key":"10.1016\/S0304-3975(97)00025-X_BIB7","series-title":"Proc. LPAR'93","first-page":"76","article-title":"Consistency checking of automata functional specifications","volume":"vol. 698","author":"Chebotarev","year":"1993"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB8","series-title":"Mathematics of Program Construction","first-page":"174","article-title":"Networks of communicating processes and their (de-)composition","volume":"vol. 375","author":"Chen","year":"1989"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB9","series-title":"Proc. 5th Ann. Symp. on Logic in Computer Science, IEEE Computer Society Press","first-page":"440","article-title":"When is \u201cpartial\u201d adequate? A logic-based proof techique using partial specifications","author":"Cleaveland","year":"1990"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB10","series-title":"Introduction to the Theory of Finite-State Machines","author":"Gill","year":"1962"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB11","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/177492.177725","article-title":"Model checking and modular verification","volume":"16","author":"Grumberg","year":"1994","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB12","series-title":"Logics and Models of Concurrent Systems","first-page":"477","article-title":"On the development of reactive systems","volume":"vol. F13","author":"Harel","year":"1985"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TSE.1984.5010246","article-title":"Protocol verification via projections","volume":"10","author":"Lam","year":"1984","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(97)00025-X_BIB14","series-title":"Proc. 6th Symp. on the Principles of Distributed Computing, ACM","first-page":"137","article-title":"Hierarchical correctness proofs for distributed algorithms","author":"Lynch","year":"1987"},{"key":"10.1016\/S0304-3975(97)00025-X_BIB15","series-title":"Current Trends in Concurrency","first-page":"510","article-title":"Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends","volume":"vol. 224","author":"Pnueli","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700025X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700025X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:50:09Z","timestamp":1555390209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700025X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S030439759700025X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00025-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}