{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T09:14:23Z","timestamp":1672391663686},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf01762126","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:22:38Z","timestamp":1118917358000},"page":"451-472","source":"Crossref","is-referenced-by-count":2,"title":["The synthesis of communication protocols"],"prefix":"10.1007","volume":"3","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Papageorgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01762126_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1984","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1984."},{"key":"BF01762126_CR2","first-page":"4","volume":"2","author":"G. Bochmann","year":"1978","unstructured":"G. Bochmann, Finite-state description of communicating protocols,Computer Networks,2, 4, 1978.","journal-title":"Computer Networks"},{"key":"BF01762126_CR3","doi-asserted-by":"crossref","unstructured":"G. Bochmann, A general transition model for protocols and communication services,IEEE Transactions on Communications,28, 4, 1980.","DOI":"10.1109\/TCOM.1980.1094696"},{"key":"BF01762126_CR4","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF01843569","volume":"1","author":"K. M. Chandy","year":"1986","unstructured":"K. M. Chandy and J. Misra, How processes learn,Distributed Computing,1, 40, 1986.","journal-title":"Distributed Computing"},{"key":"BF01762126_CR5","doi-asserted-by":"crossref","unstructured":"A. Emmerson and E. Clarke, Using branching time logic to synthesize synchronization skeletons,Science of Computer Programming,2, 1982.","DOI":"10.1016\/0167-6423(83)90017-5"},{"key":"BF01762126_CR6","unstructured":"R. Fagin, J. Halpern, and M. Vardi, A model theoretic analysis of knowledge,Proc. 1984 Conf. on Foundations of Computer Science, 1984."},{"key":"BF01762126_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"BF01762126_CR8","doi-asserted-by":"crossref","unstructured":"J. Guttag, Notes on type abstraction,Proc. Conf. on Specification of Reliable Software, 1979.","DOI":"10.1007\/BFb0014684"},{"key":"BF01762126_CR9","unstructured":"B. Hailpern and S. Owicki, Verifying network protocols using temporal logic,Proc. 1980 Symp. on Trends and Applications, 1980."},{"key":"BF01762126_CR10","doi-asserted-by":"crossref","unstructured":"J. Halpern and Y. Moses, Knowledge and common knowledge in distributed environments,Proc. 1984 Conf. on Principles of Distributed Computing, 1984.","DOI":"10.1145\/800222.806735"},{"key":"BF01762126_CR11","unstructured":"D. S. Johnson, Worst-case behavior of graph-coloring algorithms,Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, 1974."},{"key":"BF01762126_CR12","volume-title":"Elements of the Theory of Computation","author":"H. R. Lewis","year":"1982","unstructured":"H. R. Lewis and C. H. Papadimitriou,Elements of the Theory of Computation, Prentice Hall, Englewood Cliffs, NJ, 1982."},{"key":"BF01762126_CR13","first-page":"11","volume":"27","author":"P. Merlin","year":"1979","unstructured":"P. Merlin, Specification and validation of protocols,IEEE Transactions on Communications,27, 11, 1979.","journal-title":"IEEE Transactions on Communications"},{"key":"BF01762126_CR14","doi-asserted-by":"crossref","unstructured":"P. Merlin and D. Farber, Recoverability of communication protocols: implications of a theoretical study,IEEE Transactions on Communications,24, 1976.","DOI":"10.1109\/TCOM.1976.1093424"},{"key":"BF01762126_CR15","unstructured":"G. Papageorgiou, The synthesis of communication protocols, Ph.D. Thesis, National Technical University of Athens (in Greek)."},{"key":"BF01762126_CR16","unstructured":"D. Schwabe, Formal techniques for the specification and verification of protocols, Ph.D. Thesis, University of California and Los Angeles, 1981."},{"key":"BF01762126_CR17","unstructured":"R. Schwartz and P. Meliar-Smith, Temporal logic specifications of distributed systems,Proc. 2nd Int. Conf. on Distributed Computing Systems, 1981."},{"key":"BF01762126_CR18","volume-title":"Computer Networks","author":"A. Tanenbaum","year":"1981","unstructured":"A. Tanenbaum,Computer Networks, Prentice Hall, Englewood Cliffs, NJ, 1981."},{"key":"BF01762126_CR19","doi-asserted-by":"crossref","unstructured":"P. Wolper, Specifications and synthesis of communicating processes using an extended temporal logic,Proc. 1982 Conf. on Principles of Programming Languages, 1982.","DOI":"10.1145\/582153.582156"},{"key":"BF01762126_CR20","first-page":"4","volume":"28","author":"P. Zafiropoulo","year":"1980","unstructured":"P. Zafiropouloet al., Towards analyzing and synthesizing protocols,IEEE Transactions on Communications,28, 4, 1980.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762126.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762126\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:41:43Z","timestamp":1557333703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":20,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01762126"],"URL":"https:\/\/doi.org\/10.1007\/bf01762126","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}