{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T22:25:46Z","timestamp":1743459946771},"publisher-location":"Berlin, Heidelberg","reference-count":65,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653073"},{"type":"electronic","value":"9783540494416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-65307-4_52","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T17:12:24Z","timestamp":1270487544000},"page":"331-385","source":"Crossref","is-referenced-by-count":4,"title":["Distributed algorithms for networks of agents"],"prefix":"10.1007","author":[{"given":"W.","family":"Reisig","sequence":"first","affiliation":[]},{"given":"E.","family":"Kindler","sequence":"additional","affiliation":[]},{"given":"T.","family":"Vesper","sequence":"additional","affiliation":[]},{"given":"H.","family":"V\u00f6lzer","sequence":"additional","affiliation":[]},{"given":"R.","family":"Walter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"A Model of Concurrent Computation in Distributed Systems","author":"G. A. Agha","year":"1986","unstructured":"G. A. Agha: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, MA (1986)"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Bowen Alpern, Fred B. Schneider: Defining Liveness. Information Processing Letters 21, pp. 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"key":"7_CR3","series-title":"International Series in Computer Science","volume-title":"Principles of Concurrent and Distributed Programming","author":"M. Ben-Ari","year":"1990","unstructured":"M. Ben-Ari: Principles of Concurrent and Distributed Programming. International Series in Computer Science. Prentice Hall, Englewood Cliffs, N. J., (1990)"},{"key":"7_CR4","volume-title":"An Introduction to Distributed Algorithms","author":"V. Barbosa","year":"1996","unstructured":"V. Barbosa: An Introduction to Distributed Algorithms. MIT Press, Cambridge, MA (1996)"},{"key":"7_CR5","unstructured":"G. Berry, G. Boudol: The chemical abstract machine. TCS, (1982)"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-739X(88)90012-X","volume":"4","author":"J.-P. Ban\u00e2tre","year":"1988","unstructured":"J.-P. Ban\u00e2tre, A. Coutant, D. le Metayer: A Parallel Machine for Multiset Transformation and its Programming Style. Future Generations Computer Systems 4, pp. 133\u2013144 (1988)","journal-title":"Future Generations Computer Systems"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"G. Burns, J. Esparza: Trapping mutual exclusion in the box calculus. Theoretical Computer Science. Special Volume on Petri Nets 153, (1 2 ), (January 1996)","DOI":"10.1016\/0304-3975(95)00119-0"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"6","author":"C. H. Bennett","year":"1973","unstructured":"C. H. Bennett: Logical Reversibility of Computation. IBM Journal of Research and Development 6, pp. 525\u2013532 (1973)","journal-title":"IBM Journal of Research and Development"},{"key":"7_CR9","series-title":"International Series in Computer Science","volume-title":"Semantics of Sequential and Parallel Programs","author":"E. Best","year":"1996","unstructured":"Eike Best: Semantics of Sequential and Parallel Programs International Series in Computer Science. Prentice Hall, Englewood Cliffs, N. J., (1996)"},{"key":"7_CR10","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73483-0","volume-title":"Nonsequential Processes","author":"E. Best","year":"1988","unstructured":"Eike Best, C\u00e8sar Fernandez: Nonsequential Processes. volume 13 of EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, (1988)"},{"issue":"6","key":"7_CR11","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/12.24293","volume":"38","author":"G. M. Brown","year":"1989","unstructured":"G. M. Brown, M. G. Gouda, C. Wu: Token systems that self-stabilize. IEEE Transaction on Computers 38(6), pp. 845\u2013852 (1989)","journal-title":"IEEE Transaction on Computers"},{"issue":"2","key":"7_CR12","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/63264.63403","volume":"11","author":"J. E. Burnes","year":"1989","unstructured":"J. E. Burnes, J. Pachl: Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems 11(2), pp. 330\u2013344 (April 1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01786252","volume":"2","author":"M. Broy","year":"1987","unstructured":"Manfred Broy: Semantics of Finite and Infinite Networks of Concurrent Communicating Agents. Distributed Computing 2, pp. 13\u201331 (1987)","journal-title":"Distributed Computing"},{"issue":"4","key":"7_CR14","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","volume":"SE-8","author":"E. J. H. Chang","year":"1982","unstructured":"E. J. H. Chang: Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering SE-8(4), pp. 391\u2013401 (1982)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"7_CR15","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K. M. Chandy","year":"1984","unstructured":"K. M. Chandy, J. Misra: The drinking philosophers problem. ACM Transactions on Programming Languages and Systems 6(4), pp. 632\u2013646 (October 1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR16","volume-title":"Parallel Program Design: A foundation","author":"K. M. Chandy","year":"1988","unstructured":"K. M. Chandy, J. Misra: Parallel Program Design: A foundation. Addison-Wesley, MA (1988)"},{"key":"7_CR17","series-title":"LNCS Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BFb0052098","volume-title":"Foundations of Computer Science","author":"J. Desel","year":"1997","unstructured":"J. Desel: How distributed algorithms play the token game. In: C. Freksa, M. Jantzen, R. Valk (eds.): Foundations of Computer Science, Vol 1337 LNCS Lecture Notes in Computer Science, pp. 297\u2013306 Springer-Verlag, Berlin (1997)"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E. W. Dijkstra","year":"1971","unstructured":"Edsger W. Dijkstra: Hierarchical ordering of sequential processes. Acta Informatica 1, pp. 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"issue":"11","key":"7_CR19","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"E. W. Dijkstra: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), pp. 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"issue":"8","key":"7_CR20","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"E. W. Dijkstra","year":"1975","unstructured":"E. W. Dijkstra: Guarded commands, nondeterminancy, and formal derivation of programs. Comm. ACM 18(8), pp. 453\u2013457 (1975)","journal-title":"Comm. ACM"},{"issue":"2","key":"7_CR21","first-page":"207","volume":"81","author":"E. W. Dijkstra","year":"1978","unstructured":"E. W. Dijkstra: Finding the correctness proof of a concurrent program. Proc. Koninklijke Nederlandse Akademie van Wetenschappen 81(2), pp. 207\u2013215 (1978)","journal-title":"Proc. Koninklijke Nederlandse Akademie van Wetenschappen"},{"key":"7_CR22","first-page":"177","volume-title":"Proving correctness of distributed algorithms using high-level Petri nets \u2014 a case study","author":"J. Desel","year":"1998","unstructured":"J. Desel, E. Kindler: Proving correctness of distributed algorithms using high-level Petri nets \u2014 a case study. In: 1998 International Conference on Application of Concurrency to System Design, pp. 177\u2013186 Fukushima, Japan, (March 1998) IEEE Computer Society Press."},{"key":"7_CR23","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0020-0190(95)00065-K","volume":"54","author":"J. Desel","year":"1995","unstructured":"J. Desel, E. Kindler, T. Vesper, R. Walter: A simplified proof for a self-stabilizing protocol: A game of cards. Information Processing Letters 54, pp. 327\u2013328 (1995)","journal-title":"Information Processing Letters"},{"key":"7_CR24","first-page":"3","volume":"47","author":"J. Desel","year":"1994","unstructured":"J. Desel, E. Kindler, R. Walter: A game of tokens: A proof contest. Petri Net Newsletter 47, pp. 3\u20134 (October 1994)","journal-title":"Petri Net Newsletter"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"4","author":"E. W. Dijkstra","year":"1980","unstructured":"E. W. Dijkstra, C. S. Scholten: Termination Detection for Diffusing Computations. Inf. Proc. Letters 4,pp. 1\u20134 (1980)","journal-title":"Inf. Proc. Letters"},{"key":"7_CR26","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TCOM.1979.1094473","volume":"COM 27","author":"S. G. Finn","year":"1979","unstructured":"S. G. Finn: Resynch procedures and a fail safe network protocol. IEEE Transactions on Communications, COM 27, pp. 840\u2013845 (1979)","journal-title":"IEEE Transactions on Communications"},{"issue":"3\/4","key":"7_CR27","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E. Fredkin","year":"1982","unstructured":"Edward Fredkin, Tommaso Toffoli: Conservative Logic. International Journal of Theoretical Physics, Vol. 21, Nos. 3\/4, pp. 219\u2013253 (1982)","journal-title":"International Journal of Theoretical Physics"},{"key":"7_CR28","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0049-237X(08)71257-6","volume-title":"The Kleene Symposium","author":"R. Gandy","year":"1980","unstructured":"R. Gandy: Church's Thesis and Principles for Mechanisms. In: J. Barwise et al (eds.): \u201cThe Kleene Symposium\u201d, North-Holland, Amsterdamm, pp. 123\u2013148 (1980)"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"J. E. Gehrke, C. G. Plaxton, R. Rajaraman: Rapid convergence of a local load balancing algorithm for asynchronous rings. In: M. Mavronicolas, P. Tsigas (eds.): \u201cDistributed Algorithms, WDAG\u201d, Vol. 1320 of: LNCS Lecture Notes in Computer Science, pp. 81\u201395 Springer-Verlag (September 1997)","DOI":"10.1007\/BFb0030677"},{"issue":"3","key":"7_CR30","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"David Harel: Statecharts: A visual formalism for computer systems. Science of Computer Programming 8, No. 3, pp. 231\u2013274 (1987)","journal-title":"Science of Computer Programming"},{"key":"7_CR31","unstructured":"K. Jensen: Coloured Petri Nets, Vol. 1 of. EATCS Monographs on Theoretical Computer Science. Springer-Verlag (1992)"},{"key":"7_CR32","unstructured":"Ekkart Kindler: Modularer Entwurf verteilter Systeme mit Petrinetzen. PhD thesis, Technische Unviversit\u00e4t M\u00fcnchen (1995)"},{"key":"7_CR33","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01211299","volume":"9","author":"E. Kindler","year":"1997","unstructured":"E. Kindler, W. Reisig, H. V\u00f6lzer, R. Walter: Petri net based verification of distributed algorithms: An example. Formal Aspects of Computing 9, pp. 409\u2013424 (1997)","journal-title":"Formal Aspects of Computing"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"E. Kindler, R. Walter: Message passing mutex. In: J. Desel (ed.): Structures in Concurrency Theory, Workshops in Computing, pp. 205\u2013219 (May 1995) Springer-Verlag","DOI":"10.1007\/978-1-4471-3078-9_14"},{"issue":"2","key":"7_CR35","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Leslie Lamport: The Mutual Exclusion Problem: Part I \u2014 A Theory of Interprocess Communication. Journal of the ACM, Vol. 33, No. 2, pp. 313\u2013326 (1986)","journal-title":"Journal of the ACM"},{"key":"7_CR36","volume-title":"Distributed Algorithms","author":"N. A. Lynch","year":"1996","unstructured":"N. A. Lynch: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, Calif. (1996)"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Friedemann Mattern: Verteilte Basisalgorithmen. Informatik-Fachberichte 226, Springer-Verlag (1989)","DOI":"10.1007\/978-3-642-84002-9"},{"key":"7_CR38","series-title":"International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Robin Milner: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs, N. J. (1989)"},{"key":"7_CR39","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(91)90229-B","volume":"38","author":"J. Misra","year":"1991","unstructured":"J. Misra: Phase synchronisation. Information Processing Letters 38, pp. 101\u2013105 (1991)","journal-title":"Information Processing Letters"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Zohar Manna, Amir Pnueli: The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag (1992)","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"7_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems","author":"Z. Manna","year":"1995","unstructured":"Zohar Manna, Amir Pnueli: Temporal Verification of Reactive Systems. Springer-Verlag, Berlin (1995)"},{"issue":"1","key":"7_CR42","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M. Naimi","year":"1996","unstructured":"M. Naimi, M. Trehel, A. Arnold: A log(n) distributed mutual exclusion algorithm based on path reversal. Journal of Parallel and Distributed Computing 34, No. 1, p. 13 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"7_CR43","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. Owicki","year":"1982","unstructured":"Susan Owicki, Leslie Lamport: Proving liveness properties of concurrent programs. ACM Transact. on Programming Languages and Systems 4, pp. 455\u2013495 (1982)","journal-title":"ACM Transact. on Programming Languages and Systems"},{"issue":"3","key":"7_CR44","doi-asserted-by":"crossref","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, No. 3, pp.115\u2013116 (June 1981)","journal-title":"Information Processing Letters"},{"key":"7_CR45","first-page":"113","volume":"20","author":"W. Peng","year":"1996","unstructured":"W. Peng, K. Makki: Petri nets and self-stabilization of communication protocols. Informatica 20, pp. 113\u2013123 (1996)","journal-title":"Informatica"},{"key":"7_CR46","unstructured":"M. Raynal: Distributed Algorithms and Protocols. Wiley Series in parallel computing. J. Wiley and Sons (1988)"},{"issue":"1","key":"7_CR47","doi-asserted-by":"crossref","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, No. 1, pp. 61\u201377 (February 1989)","journal-title":"ACM Transactions on Computer Systems"},{"key":"7_CR48","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri nets","author":"W. Reisig","year":"1985","unstructured":"Wolfgang Reisig: Petri nets. Vol. 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin (1985)"},{"key":"7_CR49","series-title":"LNCS Lecture Notes on Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BFb0015259","volume-title":"Computer Science Today. Recent Trends and Developments","author":"W. Reisig","year":"1995","unstructured":"Wolfgang Reisig: Petri net models of distributed algorithms. In: Jan van Leeuwen (ed.): Computer Science Today. Recent Trends and Developments, Vol. 1000 of. LNCS Lecture Notes on Computer Science, pp. 441\u2013454. Springer-Verlag, Berlin (1995)"},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"W. Reisig: Interleaved progress, concurrent progress, and local progress. In: D. A. Peled, V. R. Pratt, G. J. Holzmann (eds.): Partial Order Methods in Verification, Vol. 29, pp. 24\u201326 DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/029\/06"},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"W. Reisig: Modeling and verification of distributed algorithms. In: U. Montanari, V. Sassone (eds.): CONCUR 96: Concurrency Theory, vol. 1119 of: LNCS Lecture Notes in Computer Science, pp. 79\u201395 Springer-Verlag (1996)","DOI":"10.1007\/3-540-61604-7_77"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"W. Reisig: Elements of Distributed Algorithms. Springer-Verlag (1998)","DOI":"10.1007\/978-3-662-03687-7"},{"key":"7_CR53","unstructured":"M. Raynal, J.-M. Helary: Synchronization and Control of Distributed Systems and Programs. Wiley Series in parallel computing. J. Wiley and Sons (1990)"},{"key":"7_CR54","doi-asserted-by":"crossref","unstructured":"W. Reisig, E. Kindler: Verification of distributed algorithms with algebraic Petri nets. In: C. Freksa, M. Jantzen, R. Valk (eds.): Foundations of Computer Science. Potential, Theory, Cognition, LNCS 1337, pp. 261\u2013270 Springer-Verlag (1997)","DOI":"10.1007\/BFb0052094"},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"G. Rozenberg: Behaviour of elementary net systems. In: W. Brauer, W. Reisig, G. Rozenberg (eds.): Petri Nets: Central Models and Their Properties, LNCS 254, pp. 60\u201394 Springer-Verlag (1986)","DOI":"10.1007\/978-3-540-47919-2_4"},{"key":"7_CR56","doi-asserted-by":"crossref","unstructured":"F. B. Schneider: On Concurrent Programming. Springer (1997)","DOI":"10.1007\/978-1-4612-1830-2"},{"issue":"1","key":"7_CR57","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT 29","author":"A. Segall","year":"1983","unstructured":"A. Segall: Distributed network protocols. IEEE Transactions on Information Theory, IT 29, No. 1, pp. 23\u201335 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR58","doi-asserted-by":"crossref","unstructured":"N. Shavit, N. Francez: A new approach to detection of locally indicative stability. In: L. Kott (ed.): Proceedings of the 13th ICALP, LNCS 226, pp. 344\u2013358 Springer-Verlag (1986)","DOI":"10.1007\/3-540-16761-7_84"},{"key":"7_CR59","series-title":"Cambridge International Series on Parallel Computation","volume-title":"Topics in Distributed Algorithms","author":"G. Tel","year":"1991","unstructured":"G. Tel: Topics in Distributed Algorithms. Cambridge International Series on Parallel Computation, 1, Cambridge University Press, Cambridge, U. K. (1991)"},{"key":"7_CR60","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0020419","volume-title":"Introduction to Distributed Algorithms","author":"G. Tel","year":"1994","unstructured":"G. Tel: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, U. K. (1994)"},{"key":"7_CR61","unstructured":"H. V\u00f6lzer: Verifying fault tolerance of distributed algorithms formally: An example. In: 1998 International Conference on Application of Concurrency to System Design, Fukushima, Japan, (March 1998) IEEE Computer Society Press."},{"key":"7_CR62","doi-asserted-by":"crossref","unstructured":"R\u00fcdiger Valk: Infinite Behaviour and Fairness. In: W. Brauer, W. Reisig, G. Rozenberg (eds.) Petri Nets: Central Models and Their Properties LNCS 254, pp. 377\u2013396 Springer-Verlag(1986)","DOI":"10.1007\/978-3-540-47919-2_14"},{"key":"7_CR63","volume-title":"Petrinetzmodelle verteilter Algorithmen","author":"R. Walter","year":"1995","unstructured":"R. Walter: Petrinetzmodelle verteilter Algorithmen. PhD thesis, Humboldt-Universit\u00e4t zu Berlin, Institut f\u00fcr Informatik. Edition Versal, vol.2 Bertz Verlag Berlin (1995)"},{"key":"7_CR64","doi-asserted-by":"crossref","unstructured":"R. Walter: The asynchronous stack revisited: Rounds set the twilight reeling. In: C. Freksa, M. Jantzen, R. Valk (eds.) Foundations of Computer Science, LNCS 1337, pp. 307\u2013312 Springer-Verlag (1997)","DOI":"10.1007\/BFb0052099"},{"key":"7_CR65","unstructured":"M. Weber, R. Walter, H. V\u00f6lzer, T. Vesper, W. Reisig, S. Peuker, E. Kindler, J. Freiheit, J. Desel: DAWN: Petrinetzmodelle zur Verifikation verteilter Algorithmen. Informatik-Bericht 88, Humboldt-Universit\u00e4t zu Berlin (1998)"}],"container-title":["Lecture Notes in Computer Science","Lectures on Petri Nets II: Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-65307-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T14:27:08Z","timestamp":1685543228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-65307-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653073","9783540494416"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/3-540-65307-4_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}