{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:05Z","timestamp":1759626605375,"version":"build-2065373602"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00205-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:42:39Z","timestamp":1027629759000},"page":"285-310","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algebraic nets with flexible arcs"],"prefix":"10.1016","volume":"262","author":[{"given":"Ekkart","family":"Kindler","sequence":"first","affiliation":[]},{"given":"Hagen","family":"V\u00f6lzer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00205-X_BIB1","first-page":"404","article-title":"Verifying intuition \u2013 ILF checks DAWN proofs","volume":"vol. 1639","author":"Baar","year":"1999"},{"year":"1988","series-title":"Nonsequential Processes","author":"Best","key":"10.1016\/S0304-3975(00)00205-X_BIB2"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB3","unstructured":"J. Billington, Extending Coloured Petri Nets, Tech. Rep. 148, Computer Laboratory, University of Cambridge, Cambridge, October 1988."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB4","unstructured":"J. Billington, Extensions to coloured Petri nets and their application to protocols, Tech. Rep. No. 222, University of Cambridge, Cambridge, May 1991."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB5","unstructured":"B. Brosowski, A group-theoretical approach to Petri nets, Tech. Rep. 1998, preprint."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB6","unstructured":"M. Broy, On the design and verification of a simple distributed spanning tree algorithm, SFB-Bericht 342\/24\/90 A, Technische Universtit\u00e4t M\u00fcnchen, December 1990."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(95)00117-4","article-title":"Proving nonreachability by modulo-invariants","volume":"153","author":"Desel","year":"1996","journal-title":"Theoret. Comput. Sci."},{"year":"1985","series-title":"Fundamentals of Algebraic Specifications 1, Equations and Initial Semantics","author":"Ehrig","key":"10.1016\/S0304-3975(00)00205-X_BIB8"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","article-title":"The non-sequential behaviour of Petri nets","volume":"57","author":"Goltz","year":"1983","journal-title":"Inform. and Control"},{"year":"1995","series-title":"Coloured Petri Nets, vol. 2, Analysis Methods","author":"Jensen","key":"10.1016\/S0304-3975(00)00205-X_BIB10"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB11","first-page":"16","article-title":"Algebraic system nets for modelling distributed algorithms","volume":"51","author":"Kindler","year":"1996","journal-title":"Petri Net Newslett."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB12","first-page":"261","article-title":"Verification of distributed algorithms with algebraic Petri nets","volume":"vol. 1337","author":"Kindler","year":"1997"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB13","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01211299","article-title":"Petri net based verification of distributed algorithms","volume":"9","author":"Kindler","year":"1997","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB14","doi-asserted-by":"crossref","unstructured":"E. Kindler, H. V\u00f6lzer, Flexibility in algebraic nets, in: J. Desel, M. Silva (Eds.), Application and Theory of Petri Nets 1998, 19th Internat. Conf., Lecture Notes in Computer Science, vol. 1420, Springer, Berlin, June 1998, pp. 345\u2013364.","DOI":"10.1007\/3-540-69108-1_19"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB15","first-page":"155","article-title":"The dimensions of Petri nets: the Petri net cube","volume":"66","author":"Kindler","year":"1998","journal-title":"EATCS Bull."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB16","doi-asserted-by":"crossref","unstructured":"G. Memmi, G. Roucairol, Linear algebra in net theory, in: W. Brauer (Ed.), Net Theory and Applications, Lecture Notes in Computer Science, vol. 84, Springer, Berlin, October 1979, pp. 213\u2013223.","DOI":"10.1007\/3-540-10001-6_24"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","article-title":"Petri nets are monoids","volume":"88","author":"Meseguer","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB18","unstructured":"J. Padberg, Abstract Petri nets: uniform approach and rule-based refinement, Ph.D. Thesis, Technische Universit\u00e4t Berlin, February 1996."},{"year":"1981","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","key":"10.1016\/S0304-3975(00)00205-X_BIB19"},{"year":"1985","series-title":"Petri Nets","author":"Reisig","key":"10.1016\/S0304-3975(00)00205-X_BIB20"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90203-E","article-title":"Petri nets and algebraic specifications","volume":"80","author":"Reisig","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00205-X_BIB22","first-page":"441","article-title":"Petri net models of distributed algorithms","volume":"vol. 1000","author":"Reisig","year":"1995"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB23","first-page":"427","article-title":"Verification of siphons and traps for algebraic Petri nets","volume":"vol. 1248","author":"Schmidt","year":"1997"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB24","doi-asserted-by":"crossref","unstructured":"E. Smith, W. Reisig, The semantics of a net is a net, an exercise in general net theory, in: K. Voss, H. Genrich, G. Rozenberg (Eds.), Concurrency and Nets. Springer, Berlin, 1987.","DOI":"10.1007\/978-3-642-72822-8_29"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB25","doi-asserted-by":"crossref","unstructured":"R. Valk, Bridging the gap between place- and Floyd-invariants with applications to preemptive scheduling, in: M.A. Marsan (Ed.), Application and Theory of Petri Nets 1993, 14th Internat. Conf., Lecture Notes in Computer Science, vol. 691, Springer, Berlin, June 1993, pp. 431\u2013452.","DOI":"10.1007\/3-540-56863-8_60"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB26","first-page":"293","article-title":"Parallel systems specifications with coloured Petri nets and algebraic specifications","volume":"vol. 266","author":"Vautherin","year":"1987"},{"key":"10.1016\/S0304-3975(00)00205-X_BIB27","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, December 1997."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000205X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000205X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:16Z","timestamp":1759625536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000205X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S030439750000205X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00205-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algebraic nets with flexible arcs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00205-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}