{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T23:06:38Z","timestamp":1762729598044,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030912789"},{"type":"electronic","value":"9783030912796"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91279-6_14","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T11:38:53Z","timestamp":1636544333000},"page":"195-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Upper-Bounded Model Checking for Declarative Process Models"],"prefix":"10.1007","author":[{"given":"Nicolai","family":"Sch\u00fctzenmeier","sequence":"first","affiliation":[]},{"given":"Martin","family":"K\u00e4ppel","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Petter","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Jablonski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,11]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"van der Aalst, W.M.P.: Process Mining - Discovery, Conformance and Enhancement of Business Processes. Springer, Wiesbaden (2011). https:\/\/doi.org\/10.1007\/978-3-642-19345-3","DOI":"10.1007\/978-3-642-19345-3"},{"key":"14_CR2","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-030-20618-5_5","volume-title":"Enterprise, Business-Process and Information Systems Modeling","author":"A Abbad Andaloussi","year":"2019","unstructured":"Abbad Andaloussi, A., Burattin, A., Slaats, T., Petersen, A.C.M., Hildebrandt, T.T., Weber, B.: Exploring the understandability of a hybrid process design artifact based on DCR graphs. In: Reinhartz-Berger, I., Zdravkovic, J., Gulden, J., Schmidt, R. (eds.) BPMDS\/EMMSAD -2019. LNBIP, vol. 352, pp. 69\u201384. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20618-5_5"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Ackermann, L., Sch\u00f6nig, S., Petter, S., Sch\u00fctzenmeier, N., Jablonski, S.: Execution of multi-perspective declarative process models. In: OTM 2018 Conferences (2018)","DOI":"10.1007\/978-3-030-02671-4_9"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-030-33223-5_14","volume-title":"Conceptual Modeling","author":"A Abbad Andaloussi","year":"2019","unstructured":"Abbad Andaloussi, A., Buch-Lorentsen, J., L\u00f3pez, H.A., Slaats, T., Weber, B.: Exploring the modeling of declarative processes using a hybrid approach. In: Laender, A.H.F., Pernici, B., Lim, E.-P., de Oliveira, J.P.M. (eds.) ER 2019. LNCS, vol. 11788, pp. 162\u2013170. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33223-5_14"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Burattin, A., Maggi, F.M., Sperduti, A.: Conformance checking based on multi-perspective declarative process models. Expert Syst. Appl. 65, 194\u2013211 (2016)","DOI":"10.1016\/j.eswa.2016.08.040"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.is.2016.09.005","volume":"64","author":"CD Ciccio","year":"2017","unstructured":"Ciccio, C.D., Maggi, F.M., Montali, M., Mendling, J.: Resolving inconsistencies and redundancies in declarative process models. Inf. Syst. 64, 425\u2013446 (2017)","journal-title":"Inf. Syst."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing. STOC 1971, ACM, NY, USA (1971)","DOI":"10.1145\/800157.805047"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-39696-5_6","volume-title":"Advanced Information Systems Engineering","author":"J De Smedt","year":"2016","unstructured":"De Smedt, J., De Weerdt, J., Serral, E., Vanthienen, J.: Improving understandability of declarative process models by revealing hidden dependencies. In: Nurcan, S., Soffer, P., Bajec, M., Eder, J. (eds.) CAiSE 2016. LNCS, vol. 9694, pp. 83\u201398. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39696-5_6"},{"key":"14_CR9","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-01862-6_29","volume-title":"Enterprise, Business-Process and Information Systems Modeling","author":"D Fahland","year":"2009","unstructured":"Fahland, D., et al.: Declarative versus imperative process modeling languages: the issue of understandability. In: Halpin, T. (ed.) BPMDS\/EMMSAD -2009. LNBIP, vol. 29, pp. 353\u2013366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01862-6_29"},{"key":"14_CR10","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-12186-9_45","volume-title":"Business Process Management Workshops","author":"D Fahland","year":"2010","unstructured":"Fahland, D., Mendling, J., Reijers, H.A., Weber, B., Weidlich, M., Zugal, S.: Declarative versus imperative process modeling languages: the issue of maintainability. In: Rinderle-Ma, S., Sadiq, S., Leymann, F. (eds.) BPM 2009. LNBIP, vol. 43, pp. 477\u2013488. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12186-9_45"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to B\u00fcchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53\u201365. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44585-4_6"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10270-014-0435-z","volume":"15","author":"C Haisjackl","year":"2016","unstructured":"Haisjackl, C., et al.: Understanding declare models: strategies, pitfalls, empirical results. Softw. Syst. Model. 15(2), 325\u2013352 (2016)","journal-title":"Softw. Syst. Model."},{"issue":"5\u20137","key":"14_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jlap.2013.05.005","volume":"82","author":"TT Hildebrandt","year":"2013","unstructured":"Hildebrandt, T.T., Mukkamala, R.R., Slaats, T., Zanitti, F.: Contracts for cross-organizational workflows as timed dynamic condition response graphs. J. Log. Algebr. Program. 82(5\u20137), 164\u2013185 (2013)","journal-title":"J. Log. Algebr. Program."},{"key":"14_CR14","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Pearson\/Addison Wesley, Boston (2007)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"5","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1007\/s10270-020-00857-8","volume":"20","author":"M K\u00e4ppel","year":"2021","unstructured":"K\u00e4ppel, M., Ackermann, L., Sch\u00f6nig, S., Jablonski, S.: Language-independent look-ahead for checking multi-perspective declarative process models. Softw. Syst. Model. 20(5), 1379\u20131401 (2021). https:\/\/doi.org\/10.1007\/s10270-020-00857-8","journal-title":"Softw. Syst. Model."},{"key":"14_CR17","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)"},{"key":"14_CR18","unstructured":"Pesic, M.: Constraint-based workflow management systems : shifting control to users. Ph.D. thesis, Industrial Engineering and Innovation Sciences (2008)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nig, S., Ackermann, L., Jablonski, S.: Towards an implementation of data and resource patterns in constraint-based process models. In: Modelsward (2018)","DOI":"10.5220\/0006533502710278"},{"key":"14_CR20","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-35646-0_10","volume-title":"Enterprise and Organizational Modeling and Simulation","author":"N Sch\u00fctzenmeier","year":"2019","unstructured":"Sch\u00fctzenmeier, N., K\u00e4ppel, M., Petter, S., Sch\u00f6nig, S., Jablonski, S.: Detection of declarative process constraints in LTL formulas. In: Pergl, R., Babkin, E., Lock, R., Malyzhenkov, P., Merunka, V. (eds.) EOMAS 2019. LNBIP, vol. 366, pp. 131\u2013145. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35646-0_10"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Shi, Y., Xiao, S., Li, J., Guo, J., Pu, G.: Sat-based automata construction for LTL over finite traces. In: 2020 27th Asia-Pacific Software Engineering Conference (APSEC) (2020)","DOI":"10.1109\/APSEC51365.2020.00008"},{"key":"14_CR22","unstructured":"Skydanienko, V., Francescomarino, C.D., Maggi, F.: A tool for generating event logs from multi-perspective declare models. In: BPM (Demos) (2018)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Smedt, J.D., Weerdt, J.D., Serral, E., Vanthienen, J.: Discovering hidden dependencies in constraint-based declarative process models for improving understandability. Inf. Syst. 74(Part), 40\u201352 (2018)","DOI":"10.1016\/j.is.2018.01.001"},{"key":"14_CR24","unstructured":"Westergaard, M., Stahl, C., Reijers, H.: Unconstrainedminer: efficient discovery of generalized declarative process models. BPMcenter. org, BPM reports (2013)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Zeising, M., Sch\u00f6nig, S., Jablonski, S.: Towards a common platform for the support of routine and agile business processes. In: Collaborative Computing: Networking, Applications and Worksharing (2014)","DOI":"10.4108\/icst.collaboratecom.2014.257269"},{"key":"14_CR26","unstructured":"Zuck, L.: Past temporal logic. Ph.D. thesis, Weizmann Institute, Israel (1986)"}],"container-title":["Lecture Notes in Business Information Processing","The Practice of Enterprise Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91279-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T23:02:52Z","timestamp":1762729372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91279-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030912789","9783030912796"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91279-6_14","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PoEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP Working Conference on The Practice of Enterprise Modeling","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latvia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"poem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/poem2021.rtu.lv\/","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":"14","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":"6","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":"30% - 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":"3","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":"2","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)"}}]}}