{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:47:09Z","timestamp":1743050829231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031336195"},{"type":"electronic","value":"9783031336201"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33620-1_15","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"264-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Decision Petri Nets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8307-503X","authenticated-orcid":false,"given":"Florian","family":"Wittbold","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3240-0952","authenticated-orcid":false,"given":"Rebecca","family":"Bernemann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4719-0772","authenticated-orcid":false,"given":"Reiko","family":"Heckel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3371-8564","authenticated-orcid":false,"given":"Tobias","family":"Heindel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-2889","authenticated-orcid":false,"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ic.2005.10.001","volume":"204","author":"S Abbes","year":"2006","unstructured":"Abbes, S., Benveniste, A.: True-concurrency probabilistic models: branching cells and distributed probabilities for event structures. Inf. Comput. 204(2), 231\u2013274 (2006)","journal-title":"Inf. Comput."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational complexity: a modern approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Astrom, K.J.: Optimal control of Markov decision processes with incomplete state estimation. J. Math. Anal. Appl. 10, 174\u2013205 (1965)","DOI":"10.1016\/0022-247X(65)90154-X"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-319-23267-6_12","volume-title":"Computer Performance Engineering","author":"M Beccuti","year":"2015","unstructured":"Beccuti, M., Amparore, E.G., Donatelli, S., Scheftelowitsch, D., Buchholz, P., Franceschinis, G.: Markov decision Petri nets with uncertainty. In: Beltr\u00e1n, M., Knottenbelt, W., Bradley, J. (eds.) EPEW 2015. LNCS, vol. 9272, pp. 177\u2013192. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23267-6_12"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-73094-1_6","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"M Beccuti","year":"2007","unstructured":"Beccuti, M., Franceschinis, G., Haddad, S.: Markov decision Petri net and Markov decision well-formed net formalisms. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 43\u201362. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73094-1_6"},{"issue":"5","key":"15_CR6","first-page":"679","volume":"6","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: A Markovian decision process. J. Math. Mech. 6(5), 679\u2013684 (1957)","journal-title":"J. Math. Mech."},{"key":"15_CR7","unstructured":"Bernemann, R., Cabrera, B., Heckel, R., K\u00f6nig, B.: Uncertainty reasoning for probabilistic Petri nets via Bayesian networks. In Proceedings of FSTTCS 2020, vol. 182 of LIPIcs, pp. 1\u201317. Schloss Dagstuhl - Leibniz Center for Informatics (2020)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2019.07.034","volume":"807","author":"R Bruni","year":"2020","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Bayesian network semantics for Petri nets. Theor. Comput. Sci. 807, 95\u2013113 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR9","unstructured":"Cabrera, B., Heindel, T., Heckel, R., K\u00f6nig, B.: Updating probabilistic knowledge on condition\/event nets using Bayesian networks. In Proceedings of CONCUR 2018, vol. 118 of LIPIcs, pp. 1\u201317. Schloss Dagstuhl - Leibniz Center for Informatics (2018)"},{"key":"15_CR10","unstructured":"Cassandra, A.R.: Exact and approximate algorithms for Markov decision processes, Ph. D. thesis, Brown University, USA (1998)"},{"key":"15_CR11","unstructured":"de Campos, C.P.: New complexity results for MAP in Bayesian networks. In: Proceedings of IJCAI 2011, pp. 2100\u20132106. IJCAI\/AAAI (2011)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: Free choice Petri nets. Number 40 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511526558"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Esparza, J., Heljanko, K.: Unfoldings: a partial order approach to model checking. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-77426-6","DOI":"10.1007\/978-3-540-77426-6"},{"volume-title":"Handbook of Markov Decision Processes","year":"2002","key":"15_CR15","unstructured":"Feinberg, E.A., Shwartz, A. (eds.): Handbook of Markov Decision Processes. Kluwer, Boston, MA (2002)"},{"key":"15_CR16","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman (1979)"},{"key":"15_CR17","unstructured":"Grinstead, C., Snell, L.: Markov chains. In Introduction to Probability, chapter 11, pp. 405\u2013470. American Mathematical Society, second edition (1997)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-33654-6_21","volume-title":"Graph Transformations","author":"C Krause","year":"2012","unstructured":"Krause, C., Giese, H.: Probabilistic graph transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 311\u2013325. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33654-6_21"},{"key":"15_CR19","unstructured":"Littman, M.L., Dean, T.L., Kaelbling, L.P.: On the complexity of solving Markov decision problems. In: Proceedings of UAI 1995, pp. 394\u2013402. Morgan Kaufmann (1995)"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1017584715408","volume":"27","author":"ML Littman","year":"2001","unstructured":"Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic Boolean satisfiability. J. Autom. Reason. 27(3), 251\u2013296 (2001)","journal-title":"J. Autom. Reason."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-52494-0_23","volume-title":"Advances in Petri Nets 1989","author":"MA Marsan","year":"1990","unstructured":"Marsan, M.A.: Stochastic Petri nets: an elementary introduction. In: Rozenberg, G. (ed.) APN 1988. LNCS, vol. 424, pp. 1\u201329. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52494-0_23"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-17465-1_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PJ Meyer","year":"2019","unstructured":"Meyer, P.J., Esparza, J., Offtermatt, P.: Computing the expected execution time of probabilistic workflow nets. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 154\u2013171. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17465-1_9"},{"key":"15_CR23","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1613\/jair.1236","volume":"21","author":"JD Park","year":"2004","unstructured":"Park, J.D., Darwiche, A.: Complexity results and approximation strategies for MAP explanations. J. Artif. Intell. Res. 21, 101\u2013133 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR25","unstructured":"Pearl, J.: Causality: models, reasoning, and inference. Cambridge University Press (2000)"},{"key":"15_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany (1985)"},{"issue":"5","key":"15_CR27","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"key":"15_CR28","volume-title":"An introduction to Markov chains","author":"A Tolver","year":"2016","unstructured":"Tolver, A.: An introduction to Markov chains. University of Copenhagen, Department of Mathematical Sciences (2016)"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Wittbold, F., Bernemann, R., Heckel, R., Heindel, T., K\u00f6nig, B.: Stochastic decision Petri nets (2023). arXiv:2303.13344","DOI":"10.1007\/978-3-031-33620-1_15"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33620-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T23:09:23Z","timestamp":1687043363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2023.deec.fct.unl.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}