{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:10Z","timestamp":1725663370057},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540129257"},{"type":"electronic","value":"9783540388098"}],"license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12925-1_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:59:48Z","timestamp":1330174788000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Un modele de description de protocoles : Les reseaux fermes d'automates triphases"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Arnold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Guitton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"1_CR1","unstructured":"A. ARNOLD. Synchronous nets of automata and concurrent processes. Rapport de recherche LIUP, no 11, octobre 81."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"K.A. BARTLETT, R.A. SCANTLEBURRY et P.T. Wilkinson. A note on reliable full duplex transmission over half duplex links. CACM, vol 12\u20135, may 69, p. 260\u2013265.","DOI":"10.1145\/362946.362970"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"G.B. BOCHMANN. Finite state description of communication protocols. Computer networks, vol 2, october 78, p. 361\u2013372.","DOI":"10.1016\/0376-5075(78)90015-6"},{"key":"1_CR4","unstructured":"A. GILL. Introduction to the theory of finite state machines. Mac Graw-Hill, New York, 62."},{"key":"1_CR5","unstructured":"P. GUITTON. Description, validation et test de conformit\u00e9 de protocoles de communication. Th\u00e8se de 3\u00e8 cycle, Universit\u00e9 de Bordeaux I, janvier 84."},{"key":"1_CR6","unstructured":"Z. KOHAVI. Switching and finite automata theory. Mac Graw-Hill, New York, 70."},{"key":"1_CR7","unstructured":"S. S. LAM et A. U. SHANKAR. An illustration of protocol projections. Proc. 2nd Int. workshop on protocol specification, testing and verification, may 82."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"P. M. MERLIN. A methodology for the design and implementation of communication protocols. IEEE trans on communication, vol COM 24\u20135, june 76, p. 614\u2013621.","DOI":"10.1109\/TCOM.1976.1093347"},{"key":"1_CR9","unstructured":"J. K. PACHL. Reachability problems for communicating finitestate machines. Dept of computer science, University of Waterloo, research report CS-82-12, may 82."},{"key":"1_CR10","unstructured":"R. R. RAZOUK. Modeling X25 using the graph model of behaviour. Protocol specification, testing and verification, North-Holland, p. 297\u2013314, IFIP 82."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"N.V. STENNING. A data transfer protocol. Computer networks, vol. 1\u20132, september 76, p. 99\u2013110.","DOI":"10.1016\/0376-5075(76)90015-5"},{"key":"1_CR12","unstructured":"S.T. VUONG et D.D. COWAN. Reachability analysis of protocols with FIFO channels. SIGCOMM'83 Symposium, communications architectures and protocols, university of Texas, 8\u20139 march 83."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"P. ZAFIROPOULO, H. WEST, H. RUDIN, D.D. COWAN, D. BRAND. Towards analysing and synthesizing protocols. IEEE trans on communication, vol COM 28-4, april 80, p. 651\u2013661.","DOI":"10.1109\/TCOM.1980.1094687"}],"container-title":["Lecture Notes in Computer Science","International Symposium on Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12925-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:07:45Z","timestamp":1558253265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12925-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129257","9783540388098"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-12925-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}