{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:57:00Z","timestamp":1725559020943},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540263012"},{"type":"electronic","value":"9783540315599"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494744_17","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T22:31:09Z","timestamp":1279060269000},"page":"289-308","source":"Crossref","is-referenced-by-count":14,"title":["Can I Execute My Scenario in Your Net?"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Juh\u00e1s","sequence":"first","affiliation":[]},{"given":"Robert","family":"Lorenz","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"Desel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-69108-1","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Desel","year":"1998","unstructured":"Desel, J., Reisig, W.: Place\/Transition Petri Nets. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 123\u2013174. Springer, Heidelberg (1998)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1955","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal Flow Through a Network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1955)","journal-title":"Canadian Journal of Mathematics"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45\/5","author":"A. Goldberg","year":"1998","unstructured":"Goldberg, A., Rao, S.: Beyond the Flow Decomposition Barrier. Journal of the ACM\u00a045\/5, 783\u2013797 (1998)","journal-title":"Journal of the ACM"},{"issue":"2-3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U. Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: The Non-Sequential Behaviour of Petri Nets. Information and Control\u00a057(2-3), 125\u2013147 (1983)","journal-title":"Information and Control"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/BFb0036914","volume-title":"Automata, Languages and Programming","author":"U. Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: Processes of Place\/Transition Nets. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 264\u2013277. Springer, Heidelberg (1983)"},{"key":"17_CR6","first-page":"428","volume":"IV.2","author":"J. Grabowski","year":"1981","unstructured":"Grabowski, J.: On Partial Languages. Fundamenta Informaticae\u00a0IV.2, 428\u2013498 (1981)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR7","first-page":"434","volume":"15","author":"A.V. Karzanov","year":"1974","unstructured":"Karzanov, A.V.: Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Math. Doc.\u00a015, 434\u2013437 (1974)","journal-title":"Soviet Math. Doc."},{"key":"17_CR8","first-page":"3","volume":"24","author":"A. Kiehn","year":"1988","unstructured":"Kiehn, A.: On the Interrelationship between Synchronized and Non-Synchronized Behavior of Petri Nets. Journal Inf. Process. Cybern. EIK\u00a024, 3\u201318 (1988)","journal-title":"Journal Inf. Process. Cybern. EIK"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modelling Concurrency with Partial Orders. Int. Journal of Parallel Programming\u00a015, 33\u201371 (1986)","journal-title":"Int. Journal of Parallel Programming"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","author":"W. Vogler","year":"1992","unstructured":"Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol.\u00a0625. Springer, Heidelberg (1992)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-55610-9_176","volume-title":"Advances in Petri Nets 1992","author":"W. Vogler","year":"1992","unstructured":"Vogler, W.: Partial words versus processes: a short comparison. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol.\u00a0609, pp. 292\u2013303. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494744_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:03:26Z","timestamp":1558281806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494744_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263012","9783540315599"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11494744_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}