{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:15:19Z","timestamp":1725902119112},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624099"},{"type":"electronic","value":"9783319624105"}],"license":[{"start":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T00:00:00Z","timestamp":1498003200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-62410-5_32","type":"book-chapter","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:23:02Z","timestamp":1497918182000},"page":"262-269","source":"Crossref","is-referenced-by-count":0,"title":["Inference of Channel Priorities for Asynchronous Communication"],"prefix":"10.1007","author":[{"given":"Nathana\u00ebl","family":"Sensfelder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lie","family":"Hurault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Qu\u00e9innec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"1. Jos C. M. Baeten, Jan A. Bergstra, and Jan Willem Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae, IX:127\u2013168, 1986.","key":"32_CR1","DOI":"10.3233\/FI-1986-9202"},{"doi-asserted-by":"crossref","unstructured":"2. Falko Bause. Analysis of Petri nets with a dynamic priority method. In 18th International Conference on Application and Theory of Petri Nets ICATPN\u201997, volume 1248 of Lecture Notes in Computer Science, pages 215\u2013234. Springer, 1997.","key":"32_CR2","DOI":"10.1007\/3-540-63139-9_38"},{"doi-asserted-by":"crossref","unstructured":"3. Eike Best and Maciej Koutny. Petri net semantics of priority systems. Theoretical Computer Science, 96(1):175\u2013174, 1992.","key":"32_CR3","DOI":"10.1016\/0304-3975(92)90184-H"},{"doi-asserted-by":"crossref","unstructured":"4. Juanito Camilleri and Glynn Winskel. CCS with priority choice. Information and Computation, 116(1):26\u201337, 1995.","key":"32_CR4","DOI":"10.1006\/inco.1995.1003"},{"doi-asserted-by":"crossref","unstructured":"5. Bernadette Charron-Bost, Friedemann Mattern, and Gerard Tel. Synchronous, asynchronous, and causally ordered communication. Distributed Computing, 9(4):173\u2013191, February 1996.","key":"32_CR5","DOI":"10.1007\/s004460050018"},{"unstructured":"6. Florent Chevrou, Aur\u00e9lie Hurault, and Philippe Qu\u00e9innec. Automated verification of asynchronous communicating systems with TLA+. Electronic Communications of the EASST (special issue AVOCS\u201915), 72:1\u201315, 2015.","key":"32_CR6"},{"doi-asserted-by":"crossref","unstructured":"7. Florent Chevrou, Aur\u00e9lie Hurault, and Philippe Qu\u00e9innec. On the diversity of asynchronous communication. Formal Aspects of Computing, 28(5):847\u2013879, 2016.","key":"32_CR7","DOI":"10.1007\/s00165-016-0379-x"},{"doi-asserted-by":"crossref","unstructured":"8. Edmund M. Clarke and E. Allen Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52\u201371. Springer, 1981.","key":"32_CR8","DOI":"10.1007\/BFb0025774"},{"doi-asserted-by":"crossref","unstructured":"9. Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. Information and Computation, 87(1\/2):58\u201377, 1990.","key":"32_CR9","DOI":"10.1016\/0890-5401(90)90059-Q"},{"unstructured":"10. George Coulouris, Jean Dollimore, and Tim Kindberg. Distributed Systems: concepts and design. Addison Wesley, second edition, 1994.","key":"32_CR10"},{"doi-asserted-by":"crossref","unstructured":"11. M. Elizabeth C. Hull. Occam - A programming language for multiprocessor systems. Computer Languages, 12(1):27\u201337, 1987.","key":"32_CR11","DOI":"10.1016\/0096-0551(87)90010-5"},{"unstructured":"12. Ajay D. Kshemkalyani and Mukesh Singhal. Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, March 2011.","key":"32_CR12"},{"unstructured":"13. Leslie Lamport. Specifying Systems. Addison Wesley, 2003.","key":"32_CR13"},{"doi-asserted-by":"crossref","unstructured":"14. K. V. S. Prasad. A calculus of broadcasting systems. Science of Computer Programming, 25(2-3):285\u2013327, 1995.","key":"32_CR14","DOI":"10.1016\/0167-6423(95)00017-8"},{"doi-asserted-by":"crossref","unstructured":"15. Michel Raynal. Distributed Algorithms for Message-Passing Systems. Springer, 2013.","key":"32_CR15","DOI":"10.1007\/978-3-642-38123-2"}],"container-title":["Advances in Intelligent Systems and Computing","Distributed Computing and Artificial Intelligence, 14th International Conference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62410-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T17:37:37Z","timestamp":1659116257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62410-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,21]]},"ISBN":["9783319624099","9783319624105"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62410-5_32","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,6,21]]}}}