{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:01:18Z","timestamp":1760709678684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986470"},{"type":"electronic","value":"9783319986487"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-98648-7_8","type":"book-chapter","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T08:54:36Z","timestamp":1533891276000},"page":"121-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Interestingness of Traces in Declarative Process Mining: The Janus LTLp$$_f$$ Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5730-6332","authenticated-orcid":false,"given":"Alessio","family":"Cecconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5570-0475","authenticated-orcid":false,"given":"Claudio","family":"Di Ciccio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9680-7658","authenticated-orcid":false,"given":"Giuseppe","family":"De Giacomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7260-524X","authenticated-orcid":false,"given":"Jan","family":"Mendling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,11]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0085-4","volume-title":"Data Mining for Association Rules and Sequential Patterns - Sequential and Parallel Algorithms","author":"J Adamo","year":"2001","unstructured":"Adamo, J.: Data Mining for Association Rules and Sequential Patterns - Sequential and Parallel Algorithms. Springer, New York (2001). https:\/\/doi.org\/10.1007\/978-1-4613-0085-4"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., De Masellis, R., Montali, M.: Reasoning on LTL on finite traces: insensitivity to infiniteness. In: AAAI, pp. 1027\u20131033 (2014)","DOI":"10.1609\/aaai.v28i1.8872"},{"key":"8_CR3","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI, pp. 854\u2013860. Association for Computing Machinery (2013)"},{"key":"8_CR4","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-24626-0_2","volume-title":"Enterprise and Organizational Modeling and Simulation","author":"C Di Ciccio","year":"2015","unstructured":"Di Ciccio, C., Bernardi, M.L., Cimitile, M., Maggi, F.M.: Generating event logs through the simulation of declare models. In: Barjis, J., Pergl, R., Babkin, E. (eds.) EOMAS 2015. LNBIP, vol. 231, pp. 20\u201336. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24626-0_2"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.is.2016.09.005","volume":"64","author":"C Di Ciccio","year":"2017","unstructured":"Di Ciccio, C., 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."},{"issue":"4","key":"8_CR6","first-page":"24","volume":"5","author":"C Di Ciccio","year":"2015","unstructured":"Di Ciccio, C., Mecella, M.: On the discovery of declarative control flows for artful processes. ACM Trans. Manag. Inf. Syst. (TMIS) 5(4), 24 (2015)","journal-title":"ACM Trans. Manag. Inf. Syst. (TMIS)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: ICSE, pp. 411\u2013420. IEEE (1999)","DOI":"10.1145\/302405.302672"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-51803-7_36","volume-title":"Temporal Logic in Specification","author":"D Gabbay","year":"1989","unstructured":"Gabbay, D.: The declarative past and imperative future. In: Banieqbal, B., Barringer, H., Pnueli, A. (eds.) Temporal Logic in Specification. LNCS, vol. 398, pp. 409\u2013448. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51803-7_36"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-45138-9_38","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P Gastin","year":"2003","unstructured":"Gastin, P., Oddoux, D.: LTL with past and two-way very-weak alternating automata. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 439\u2013448. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45138-9_38"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JG Henriksen","year":"1995","unstructured":"Henriksen, J.G., Jensen, J., J\u00f8rgensen, M., Klarlund, N., Paige, R., Rauhe, T., Sandholm, A.: Mona: monadic second-order logic in practice. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89\u2013110. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60630-0_5"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-32355-3_3","volume-title":"Foundations of Health Informatics Engineering and Systems","author":"T Hildebrandt","year":"2012","unstructured":"Hildebrandt, T., Mukkamala, R.R., Slaats, T.: Declarative modelling and safe distribution of healthcare workflows. In: Liu, Z., Wassyng, A. (eds.) FHIES 2011. LNCS, vol. 7151, pp. 39\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32355-3_3"},{"key":"8_CR12","unstructured":"Hodkinson, I.M., Reynolds, M.: Separation-past, present, and future. In: We Will Show Them!, vol. 2, pp. 117\u2013142 (2005)"},{"key":"8_CR13","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson\/Addison Wesley, Boston (2007)"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s100090100062","volume":"4","author":"O Kupferman","year":"2003","unstructured":"Kupferman, O., Vardi, M.Y.: Vacuity detection in temporal model checking. Int. J. Softw. Tools Technol. Transf. 4(2), 224\u2013233 (2003)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.is.2013.12.005","volume":"47","author":"M de Leoni","year":"2015","unstructured":"de Leoni, M., Maggi, F.M., van der Aalst, W.M.P.: An alignment-based framework to check the conformance of declarative process models and to preprocess event-log data. Inf. Syst. 47, 258\u2013277 (2015)","journal-title":"Inf. Syst."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume-title":"Logics of Programs","author":"O Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 196\u2013218. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-15648-8_16"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-25109-2_7","volume-title":"On the Move to Meaningful Internet Systems: OTM 2011","author":"LT Ly","year":"2011","unstructured":"Ly, L.T., Rinderle-Ma, S., Knuplesch, D., Dadam, P.: Monitoring business process compliance using compliance rule graphs. In: Meersman, R., Dillon, T., Herrero, P., Kumar, A., Reichert, M., Qing, L., Ooi, B.-C., Damiani, E., Schmidt, D.C., White, J., Hauswirth, M., Hitzler, P., Mohania, M. (eds.) OTM 2011. LNCS, vol. 7044, pp. 82\u201399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25109-2_7"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-31095-9_18","volume-title":"Advanced Information Systems Engineering","author":"FM Maggi","year":"2012","unstructured":"Maggi, F.M., Bose, R.P.J.C., van der Aalst, W.M.P.: Efficient discovery of understandable declarative process models from event logs. In: Ralyt\u00e9, J., Franch, X., Brinkkemper, S., Wrycza, S. (eds.) CAiSE 2012. LNCS, vol. 7328, pp. 270\u2013285. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31095-9_18"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.is.2017.12.002","volume":"74","author":"FM Maggi","year":"2018","unstructured":"Maggi, F.M., Di Ciccio, C., Di Francescomarino, C., Kala, T.: Parallel algorithms for the automated discovery of declarative process models. Inf. Syst. 74, 136\u2013152 (2018)","journal-title":"Inf. Syst."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-45348-4_10","volume-title":"Business Process Management","author":"FM Maggi","year":"2016","unstructured":"Maggi, F.M., Montali, M., Di Ciccio, C., Mendling, J.: Semantical vacuity detection in declarative process mining. In: La Rosa, M., Loos, P., Pastor, O. (eds.) BPM 2016. LNCS, vol. 9850, pp. 158\u2013175. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45348-4_10"},{"key":"8_CR21","unstructured":"Mannhardt, F., Blinde, D.: Analyzing the trajectories of patients with sepsis using process mining. In: RADAR+ EMISA, vol. 1859, pp. 72\u201380 (2017)"},{"issue":"2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S1571-0661(05)80366-4","volume":"68","author":"N Markey","year":"2002","unstructured":"Markey, N.: Past is for free: on the complexity of verifying linear temporal properties with past. Electr. Notes Theor. Comput. Sci. 68(2), 87\u2013104 (2002)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"8_CR23","unstructured":"Pesic, M.: Constraint-based workflow management systems: shifting control to users (2008)"},{"issue":"3","key":"8_CR24","doi-asserted-by":"crossref","first-page":"271","DOI":"10.3233\/FI-1992-17307","volume":"17","author":"YS Ramakrishna","year":"1992","unstructured":"Ramakrishna, Y.S., Moser, L.E., Dillon, L.K., Melliar-Smith, P.M., Kutty, G.: An automata-theoretic decision procedure for propositional temporal logic with since and until. Fundam. Inform. 17(3), 271\u2013282 (1992)","journal-title":"Fundam. Inform."},{"issue":"8","key":"8_CR25","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1016\/j.apal.2010.01.002","volume":"161","author":"M Reynolds","year":"2010","unstructured":"Reynolds, M.: The complexity of temporal logic over the reals. Ann. Pure Appl. Log. 161(8), 1063\u20131096 (2010)","journal-title":"Ann. Pure Appl. Log."},{"key":"8_CR26","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS, pp. 322\u2013331. IEEE Computer Society (1986)"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: Symbolic LTLf synthesis. In: IJCAI, pp. 1362\u20131369 (2017)","DOI":"10.24963\/ijcai.2017\/189"}],"container-title":["Lecture Notes in Computer Science","Business Process Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98648-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:32:12Z","timestamp":1709811132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98648-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986470","9783319986487"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98648-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Business Process Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bpm2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bpm2018.web.cse.unsw.edu.au\/","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":"113","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":"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":"12% - 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)"}}]}}