乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:06:40Z","timestamp":1725466000815},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637462"},{"type":"electronic","value":"9783540696407"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052098","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:02:10Z","timestamp":1149642130000},"page":"297-306","source":"Crossref","is-referenced-by-count":4,"title":["How distributed algorithms play the token game"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Desel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"key":"27_CR1","unstructured":"A.V. Aho and J.D. Ullmann. Foundations of Computer Science. Computer Science Press (1992)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"F.L. Bauer and G. Goos. Informatik \u2014 eine einf\u00fchrende \u00fcbersicht. 4. Auflage, Springer-Verlag (1991)","DOI":"10.1007\/978-3-642-58185-4"},{"key":"27_CR3","first-page":"2","volume":"17","author":"E. Best","year":"1982","unstructured":"E. Best. Representing a Program Invariant as a Linear Invariant in a Petri Net. Bulletin of the EATCS 17, 2\u201311 (1982)","journal-title":"Bulletin of the EATCS"},{"key":"27_CR4","unstructured":"E. Best. Semantics of Sequential and Parallel Programs. Prentice Hall International Series in Computer Science. Prentice Hall (1996)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins. H. Klaudel and E. Pelz. An M-net Semantics of B(PN)2. Structures in Concurrency Theory, Berlin 1995 (J. Desel, ed.), Workshops in Computing, Springer-Verlag, 85\u2013100 (1995)","DOI":"10.1007\/978-1-4471-3078-9_6"},{"key":"27_CR6","unstructured":"W. Brauer. How to Play the Token Game. Petri Net Newsletter 16, Gesellschaft f\u00fcr Informatik, 3\u201313 (1984)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"W. Brauer, W. Reisig and G. Rozenberg (ed.). Petri Nets: Central Models and Their Properties. LNCS 254. Springer-Verlag (1987)","DOI":"10.1007\/978-3-540-47919-2"},{"key":"27_CR8","unstructured":"J. Desel and E. Kindler. Proving Correctness of Distributed Algorithms \u2014 A Petri Net Approach. Forschungsbericht 348 des Institutes AIFB der Universit\u00e4t Karlsruhe"},{"key":"27_CR9","unstructured":"J. Desel, W. Reisig and R. Walter. The Alternating Bit Protocol \u2014 Fairness Versus Priority. Petri Net Newsletter 35, Gesellschaft f\u00fcr Informatik, 3\u20135 (1990)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra. Cooperating Sequential Processes. Programming Languages (F. Genuys, ed.), Academic Press. 43\u2013112 (1968)","DOI":"10.1007\/978-1-4757-3472-0_2"},{"issue":"1\u20132","key":"27_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(95)00119-0","volume":"153","author":"J. Esparza","year":"1996","unstructured":"J. Esparza and G. Bruns. Trapping Mutual Exclusion in the Box Calculus. Theoretical Computer Science 153(1\u20132), 95\u2013128 (1996)","journal-title":"Theoretical Computer Science"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(81)90113-4","volume":"13","author":"H.J. Genrich","year":"1981","unstructured":"H.J. Genrich and K. Lautenbach. System Modelling with High-level Petri Nets. Theoretical Computer Science 13, 109\u2013136 (1981)","journal-title":"Theoretical Computer Science"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"G. Goos. Vorlesungen \u00fcber Informatik \u2014 Band 1: Grundlagen und funktionales Programmieren. Springer-Verlag (1995)","DOI":"10.1007\/978-3-662-10818-5_1"},{"key":"27_CR14","unstructured":"D. Harel. Algorithmics: The Spirit of Computing. Addison Wesley (1992)"},{"key":"27_CR15","unstructured":"D. Hauschildt. A Petri Net Implementation. Mitteilung 145 des Fachbereiches Informatik der Universit\u00e4t Hamburg (1987)"},{"issue":"7","key":"27_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"R.M. Keller: Formal Verification of Parallel Programs. Communications of the ACM 19(7), 371\u2013384 (1976)","journal-title":"Communications of the ACM"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"E. Kindler and R. Walter. Message Passing Mutex. Structures in Concurrency Theory (J. Desel, ed.), Workshops in Computing, Springer-Verlag, 205\u2013219 (1995)","DOI":"10.1007\/978-1-4471-3078-9_14"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G.L. Peterson","year":"1981","unstructured":"G.L. Peterson. Myths about the Mutual Exclusion Problem. Information Processing Letters 12(3), 115\u2013116 (1981)","journal-title":"Information Processing Letters"},{"key":"27_CR19","unstructured":"N. Lynch. Distributed Algorithms. Morgan Kaufmann (1996)"},{"issue":"1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"K. Raymond. A Tree-Based Algorithm for Distributed Mutual Exclusion. ACM Transactions on Computer Systems 7(1), 61\u201377 (1989)","journal-title":"ACM Transactions on Computer Systems"},{"key":"27_CR21","unstructured":"M. Raynal. Algorithms for Mutual Exclusion. North Oxford Academic (1986)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"W. Reisig. Petri Net Models of Distributed Algorithms. Computer Science Today (J. v. Leeuwen, ed.), LNCS 1000. Springer-Verlag, 441\u2013455 (1988)","DOI":"10.1007\/BFb0015259"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"W. Reisig. Modelling and Verification of Distributed Algorithms. CONCUR'96, (U. Montanari and V. Sassone, ed.), LNCS 1119, Springer-Verlag, 579\u2013595 (1996)","DOI":"10.1007\/3-540-61604-7_77"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"D. Taubner. On the Implementation of Petri Nets. Advances in Petri Nets 1988 (G. Rozenberg, ed.), LNCS 340. Springer-Verlag, 418\u2013439 (1988)","DOI":"10.1007\/3-540-50580-6_40"},{"key":"27_CR25","unstructured":"R. Valk. On Theory and Practice: An Exercise in Fairness. Petri Net Newsletter 26, Gesellschaft f\u00fcr Informatik. 4\u201311 (1987)"},{"key":"27_CR26","unstructured":"R. Walter. Petrinetzmodelle verteilter Algorithmen. Edition VERSAL 2, Bertz Verlag (1995)"},{"key":"27_CR27","unstructured":"R. Walter, H. V\u00f6lzer, T. Vesper, W. Reisig, E. Kindler, J. Freiheit and J. Desel. Memorandum Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Bericht 67 der Humboldt-Universit\u00e4t zu Berlin (1996)."}],"container-title":["Lecture Notes in Computer Science","Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:28:27Z","timestamp":1555640907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637462","9783540696407"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0052098","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}