{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T01:30:03Z","timestamp":1762738203349},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030356453"},{"type":"electronic","value":"9783030356460"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35646-0_10","type":"book-chapter","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T14:02:57Z","timestamp":1573653777000},"page":"131-145","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Detection of Declarative Process Constraints in LTL Formulas"],"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":"Sch\u00f6nig","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Jablonski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56509-4","volume-title":"Fundamentals of Business Process Management","author":"M Dumas","year":"2018","unstructured":"Dumas, M., Rosa, M.L., Mendling, J., Reijers, H.A.: Fundamentals of Business Process Management, 2nd edn. Springer, Heidelberg (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-662-56509-4","edition":"2"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Pesic, M., Schonenberg, H., van der Aalst, W.M.P.: Declare: full support for loosely-structured processes. In: IEEE EDOC Conference 2007, pp. 287\u2013300 (2007)","DOI":"10.1109\/EDOC.2007.14"},{"issue":"5\u20137","key":"10_CR3","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":"10_CR4","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, pp. 271\u2013278 (2018)","DOI":"10.5220\/0006533502710278"},{"key":"10_CR5","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":"10_CR6","doi-asserted-by":"crossref","unstructured":"Maggi, F.M., Mooij, A., van der Aalst, W.: User-guided discovery of declarative process models. In: CIDM, pp. 192\u2013199 (2011)","DOI":"10.1109\/CIDM.2011.5949297"},{"key":"10_CR7","first-page":"12","volume":"58","author":"J Smedt De","year":"2015","unstructured":"De Smedt, J., Weerdt, J., Vanthienen, J., Poels, G.: Mixed-paradigm process modeling with intertwined state spaces. Bus. Inf. Syst. Eng. 58, 12 (2015)","journal-title":"Bus. Inf. Syst. Eng."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11837862_18","volume-title":"Business Process Management Workshops","author":"M Pesic","year":"2006","unstructured":"Pesic, M., van der Aalst, W.M.P.: A declarative approach for flexible business processes management. In: Eder, J., Dustdar, S. (eds.) BPM 2006. LNCS, vol. 4103, pp. 169\u2013180. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11837862_18"},{"key":"10_CR9","series-title":"Representation and Mind Series","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. Representation and Mind Series. The MIT Press, Cambridge (2008)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and modal logic. In: Formal Models and Semantics, pp. 995\u20131072. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Fornara, N., Colombetti, M.: Specifying artificial institutions in the event calculus. In: Handbook of Research on Multi-agent Systems: Semantics and Dynamics of Organizational Models, pp. 335\u2013366. IGI Global (2009)","DOI":"10.4018\/978-1-60566-256-5.ch014"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Pesic, M., Schonenberg, H., Van der Aalst, W.M.: Declare: full support for loosely-structured processes. In: 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), p. 287. IEEE (2007)","DOI":"10.1109\/EDOC.2007.14"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-09870-8_21","volume-title":"Rules on the Web. From Theory to Applications","author":"ML Bernardi","year":"2014","unstructured":"Bernardi, M.L., Cimitile, M., Di Francescomarino, C., Maggi, F.M.: Using discriminative rule mining to discover declarative process models with non-atomic activities. In: Bikakis, A., Fodor, P., Roman, D. (eds.) RuleML 2014. LNCS, vol. 8620, pp. 281\u2013295. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09870-8_21"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-22885-3_9","volume-title":"Service-Oriented Computing - ICSOC 2014 Workshops","author":"Michaela Baumann","year":"2015","unstructured":"Baumann, M., Baumann, M.H., Sch\u00f6nig, S., Jablonski, S.: Resource-aware process model similarity matching. In: ICSOC 2014 Workshops, pp. 96\u2013107 (2014)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Lamma, E., Mello, P., Riguzzi, F., Storari, S.: Applying inductive logic programming to process mining. In: Inductive Logic Programming, pp. 132\u2013146 (2007)","DOI":"10.1007\/978-3-540-78469-2_16"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-00899-3_16","volume-title":"Transactions on Petri Nets and Other Models of Concurrency II","author":"F Chesani","year":"2009","unstructured":"Chesani, F., Lamma, E., Mello, P., Montali, M., Riguzzi, F., Storari, S.: Exploiting inductive logic programming techniques for declarative process mining. In: Jensen, K., van der Aalst, W.M.P. (eds.) Transactions on Petri Nets and Other Models of Concurrency II. LNCS, vol. 5460, pp. 278\u2013295. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00899-3_16"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-33606-5_16","volume-title":"On the Move to Meaningful Internet Systems: OTM 2012","author":"M Westergaard","year":"2012","unstructured":"Westergaard, M., Maggi, F.M.: Looking into the future: using timed automata to provide a priori advice about timed declarative process models. In: Meersman, R., et al. (eds.) OTM 2012, Part I. LNCS, vol. 7565, pp. 250\u2013267. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33606-5_16"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Montali, M., Chesani, F., Mello, P., Maggi, F.M.: Towards data-aware constraints in declare. In: SAC, pp. 1391\u20131396. ACM (2013)","DOI":"10.1145\/2480362.2480624"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.eswa.2016.08.040","volume":"65","author":"A Burattin","year":"2016","unstructured":"Burattin, A., Maggi, F.M., Sperduti, A.: Conformance checking based on multi-perspective declarative process models. Expert Syst. Appl. 65, 194\u2013211 (2016)","journal-title":"Expert Syst. Appl."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-46295-0_6","volume-title":"Service-Oriented Computing","author":"S Sch\u00f6nig","year":"2016","unstructured":"Sch\u00f6nig, S., Di Ciccio, C., Maggi, F.M., Mendling, J.: Discovery of multi-perspective declarative process models. In: Sheng, Q.Z., Stroulia, E., Tata, S., Bhiri, S. (eds.) ICSOC 2016. LNCS, vol. 9936, pp. 87\u2013103. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46295-0_6"},{"key":"10_CR21","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-58457-7_5","volume-title":"Business Process Management Workshops","author":"L Ackermann","year":"2017","unstructured":"Ackermann, L., Sch\u00f6nig, S., Jablonski, S.: Simulation of multi-perspective declarative process models. In: Dumas, M., Fantinato, M. (eds.) BPM 2016. LNBIP, vol. 281, pp. 61\u201373. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-58457-7_5"},{"key":"10_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":"10_CR23","first-page":"154","volume-title":"Lecture Notes in Computer Science","author":"Lars Ackermann","year":"2018","unstructured":"Ackermann, L., Sch\u00f6nig, S., Petter, S., Sch\u00fctzenmeier, N., Jablonski, S.: Execution of multi-perspective declarative process models. In: OTM 2018 Conferences, pp. 154\u2013172 (2018)"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"van der Aalst, W., Pesic, M., Schonenberg, H.: Declarative workflows: balancing between flexibility and support. In: CSRD, pp. 99\u2013113 (2009)","DOI":"10.1007\/s00450-009-0057-9"},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1658373.1658376","volume":"4","author":"M Montali","year":"2010","unstructured":"Montali, M., Pesic, M., van der Aalst, W.M.P., Chesani, F., Mello, P., Storari, S.: Declarative specification and verification of service choreographies. ACM Trans. Web 4(1), 3 (2010)","journal-title":"ACM Trans. Web"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Burattin, A., Maggi, F.M., van der Aalst, W.M., Sperduti, A.: Techniques for a posteriori analysis of declarative processes. In: EDOC, Beijing, pp. 41\u201350. IEEE, September 2012","DOI":"10.1109\/EDOC.2012.15"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-30494-4_14","volume-title":"Formal Methods in Computer-Aided Design","author":"T Latvala","year":"2004","unstructured":"Latvala, T., Biere, A., Heljanko, K., Junttila, T.: Simple bounded LTL model checking. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 186\u2013200. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30494-4_14"},{"key":"10_CR28","unstructured":"Tauriainen, H.: Automata and linear temporal logic: translations with transition-based acceptance, January 2006"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-27813-9_5","volume-title":"Computer Aided Verification","author":"KS Namjoshi","year":"2004","unstructured":"Namjoshi, K.S.: An efficiently checkable, proof-based formulation of vacuity in model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 57\u201369. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27813-9_5"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Business Information Processing","Enterprise and Organizational Modeling and Simulation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35646-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T14:09:41Z","timestamp":1573654181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35646-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030356453","9783030356460"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35646-0_10","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EOMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Enterprise and Organizational Modeling and Simulation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eomas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eomas-workshop.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"25","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":"12","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":"1","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":"48% - 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":"3","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)"}}]}}