{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:32:35Z","timestamp":1742635955795,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558088"},{"type":"electronic","value":"9783540472919"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55808-x_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:45:54Z","timestamp":1330249554000},"page":"275-283","source":"Crossref","is-referenced-by-count":2,"title":["Dataflow semantics for Petri nets"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"26_CR1","series-title":"LNCS 107","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-10699-5_102","volume-title":"Proc. of the International Colloquium on Formalization of Programming Concepts","author":"J.D. Brock","year":"1981","unstructured":"Brock, J.D.; Ackerman, W.B.: Scenarios: A model of non-determinate computation. In: Diaz, J.; Ramos, I. (eds.), Proc. of the International Colloquium on Formalization of Programming Concepts, Peniscola 1981, LNCS 107, pp. 252\u2013259, Springer (1981)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6423(88)90016-0","volume":"10","author":"M. Broy","year":"1988","unstructured":"Broy, M.: Nondeterministic data flow programs: how to avoid the merge anomaly. Science of Computer Programming 10, pp. 65\u201385 (1988)","journal-title":"Science of Computer Programming"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Brauer, W.; Reisig, W.; Rozenberg, G. (eds.): Petri nets: central models and their properties. LNCS 254, Springer (1987)","DOI":"10.1007\/978-3-540-47919-2"},{"key":"26_CR4","unstructured":"Broy, M.; Streicher, T.: Modular functional modelling of Petri nets with individual tokens. TU M\u00fcnchen, Inst. f\u00fcr Informatik, Report No. TUM-19035 (1990)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Gold, R.: Dataflow semantics for Petri nets. TU M\u00fcnchen, Inst. f\u00fcr Informatik, Report No. TUM-I9107 (1991)","DOI":"10.1007\/3-540-55808-X_26"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Gunter, C.A.; Scott, D.S.: Semantic domains. In: van Leeuwen, J. (ed.), Formal Models and Semantics, Handbook of Theoretical Computer Science, Volume B, pp. 633\u2013674, Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50017-2"},{"key":"26_CR7","unstructured":"Hitchcock, P.; Park, D.: Induction rules and termination proofs. In: Nivat, M. (ed.), Proc. of the Symposium on Automata, Languages and Programming, pp. 225\u2013251, North-Holland (1972)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Jonsson, B.: A fully abstract trace model for dataflow networks. In: Proc. of the 16th Annual ACM Symposium on Principles of Programming Languages, Austin 1989, pp. 155\u2013165 (1989)","DOI":"10.1145\/75277.75291"},{"key":"26_CR9","unstructured":"Kahn, G.: A preliminary theory for parallel programs. IRIA Rapport de Recherche 6 (1973)"},{"key":"26_CR10","unstructured":"Keller, R.M.: Denotational models for parallel programs with indeterminate operators. In: Neuhold, E.J. (ed.), Formal Description of Programming Concepts, pp. 337\u2013366, North-Holland (1978)"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01888222","volume":"2","author":"J. Misra","year":"1990","unstructured":"Misra, J.: Equational reasoning about nondeterministic processes. Formal Aspects of Computing 2, pp. 167\u2013195 (1990)","journal-title":"Formal Aspects of Computing"},{"key":"26_CR12","unstructured":"Reisig, W.: On solving conflicts in Petri nets. In: Pape, U. (ed.), Discrete Structures and Algorithms, pp. 241\u2013253, Hanser (1980)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri nets. Springer (1985)","DOI":"10.1007\/978-3-642-69968-9"},{"key":"26_CR14","first-page":"357","volume":"30","author":"D. Taubner","year":"1988","unstructured":"Taubner, D.: Zur verteilten Implementierung von Petrinetzen. Informationstechnik 30, pp. 357\u2013370 (1988)","journal-title":"Informationstechnik"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1992"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/3-540-55808-X_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:29:39Z","timestamp":1742592579000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/3-540-55808-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558088","9783540472919"],"references-count":14,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/3-540-55808-x_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}