{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:30:48Z","timestamp":1767141048039,"version":"build-2238731810"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100020618","name":"Universit\u00e4t Bayreuth","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100020618","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Softw Syst Model"],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The Declare process modeling language has been established within the research community for modeling so-called flexible processes. Declare follows the declarative modeling paradigm and therefore guarantees flexible process execution. For several reasons, declarative process models turned out to be hard to read and comprehend. Thus, it is also hard to decide whether two process models are equal with respect to their semantic meaning, whether one model is completely contained in another one or how far two models overlap. In this paper, we follow an automaton-based approach by transforming Declare process models into finite state automatons and applying automata theory for solving this issue.<\/jats:p>","DOI":"10.1007\/s10270-022-01069-y","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T12:05:51Z","timestamp":1670241951000},"page":"667-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Automaton-based comparison of Declare process models"],"prefix":"10.1007","volume":"22","author":[{"given":"Nicolai","family":"Sch\u00fctzenmeier","sequence":"first","affiliation":[]},{"given":"Martin","family":"K\u00e4ppel","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Ackermann","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Jablonski","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Petter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,5]]},"reference":[{"key":"1069_CR1","doi-asserted-by":"crossref","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: Business Process Management Workshops, pp. 477\u2013488. Springer (2010)","DOI":"10.1007\/978-3-642-12186-9_45"},{"key":"1069_CR2","doi-asserted-by":"crossref","unstructured":"Fahland, D., L\u00fcbke, D., Mendling, J., Reijers, H., Weber, B., Weidlich, M., Zugal, S.: Declarative versus imperative process modeling languages: the issue of understandability. Springer (2009)","DOI":"10.1007\/978-3-642-01862-6_29"},{"key":"1069_CR3","unstructured":"Pesic, M.: Constraint-based workflow management systems: shifting control to users. Ph.D. thesis, Industrial Engineering and Innovation Sciences (2008)"},{"key":"1069_CR4","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."},{"issue":"5\u20137","key":"1069_CR5","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. Algebraic Program. 82(5\u20137), 164\u2013185 (2013)","journal-title":"J. Log. Algebraic Program."},{"key":"1069_CR6","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":"1069_CR7","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":"1069_CR8","first-page":"69","volume-title":"Exploring the Understandability of a Hybrid Process Design Artifact Based on DCR Graphs","author":"A Abbad Andaloussi","year":"2019","unstructured":"Abbad Andaloussi, A., Burattin, A., Slaats, T., Petersen, A.C., Hildebrandt, T.T., Weber, B.: Exploring the Understandability of a Hybrid Process Design Artifact Based on DCR Graphs, pp. 69\u201384. Springer, Cham (2019)"},{"key":"1069_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-91279-6_14","volume-title":"The Practice of Enterprise Modeling","author":"N Sch\u00fctzenmeier","year":"2021","unstructured":"Sch\u00fctzenmeier, N., K\u00e4ppel, M., Petter, S., Jablonski, S.: Upper-bounded model checking for declarative process models. In: Serral, E., Stirna, J., Ralyt\u00e9, J., Grabis, J. (eds.) The Practice of Enterprise Modeling, pp. 195\u2013211. Springer, Cham (2021)"},{"key":"1069_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process Mining: Discovery, Conformance and Enhancement of Business Processes","author":"WMP van de Aalst","year":"2011","unstructured":"van de Aalst, W.M.P.: Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer, Wiesbaden (2011)"},{"key":"1069_CR11","unstructured":"Zuck, L.: Past temporal logic. Ph.D. thesis, Weizmann Institute, Israel (1986)"},{"key":"1069_CR12","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: Proceedings of 17th Annual IEEE Symposium on Logic in Computer Science (2002)"},{"key":"1069_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"2007","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Pearson\/Addison Wesley, Boston (2007)"},{"key":"1069_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J Hopcroft","year":"1971","unstructured":"Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189\u2013196. Academic Press, Cambridge (1971). https:\/\/doi.org\/10.1016\/B978-0-12-417750-5.50022-1"},{"key":"1069_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/11841760_10","volume-title":"Business Process Management","author":"WMP van der Aalst","year":"2006","unstructured":"van der Aalst, W.M.P., de Medeiros, A.K.A., Weijters, A.J.M.M.: Process equivalence: comparing two process models based on observed behavior. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) Business Process Management, pp. 129\u2013144. Springer, Berlin (2006)"},{"issue":"2","key":"1069_CR16","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.compind.2011.11.003","volume":"63","author":"M Becker","year":"2012","unstructured":"Becker, M., Laue, R.: A comparative survey of business process similarity measures. Comput. Ind. 63(2), 148\u2013167 (2012). https:\/\/doi.org\/10.1016\/j.compind.2011.11.003. (Managing Large Collections of Business Process Models)","journal-title":"Comput. Ind."},{"key":"1069_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.is.2014.11.010","volume":"49","author":"M La Rosa","year":"2015","unstructured":"La Rosa, M., Dumas, M., Ekanayake, C., Garc\u00eda-Ba\u00f1uelos, L., Recker, J., Hofstede, A.: Detecting approximate clones in business process model repositories. Inf. Syst. 49, 102\u2013125 (2015). https:\/\/doi.org\/10.1016\/j.is.2014.11.010","journal-title":"Inf. Syst."},{"key":"1069_CR18","doi-asserted-by":"crossref","unstructured":"Tealeb, A., Awad, A., Galal-Edeen, G.: Context-based variant generation of business process models, vol. 175, pp. 363\u2013377 (2014)","DOI":"10.1007\/978-3-662-43745-2_25"},{"issue":"2","key":"1069_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10270-014-0435-z","volume":"15","author":"C Haisjackl","year":"2016","unstructured":"Haisjackl, C., Barba, I., Zugal, S., Soffer, P., Hadar, I., Reichert, M., Pinggera, J., Weber, B.: Understanding declare models: strategies, pitfalls, empirical results. Softw. Syst. Model. 15(2), 325\u2013352 (2016)","journal-title":"Softw. Syst. Model."},{"key":"1069_CR20","doi-asserted-by":"crossref","unstructured":"Andaloussi, A.A., Buch-Lorentsen, J., Lopez, H.A., Slaats, T., Weber, B.: Exploring the modeling of declarative processes using a hybrid approach. In: Proceedings of 38th International Conference on Conceptual Modeling 2019, pp. 162\u2013170. Springer (2019)","DOI":"10.1007\/978-3-030-33223-5_14"},{"key":"1069_CR21","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."},{"issue":"Part","key":"1069_CR22","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.is.2018.01.001","volume":"74","author":"JD Smedt","year":"2018","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)","journal-title":"Inf. Syst."},{"key":"1069_CR23","doi-asserted-by":"crossref","unstructured":"De\u00a0Smedt, J., De\u00a0Weerdt, J., Serral, E., Vanthienen, J.: Improving understandability of declarative process models by revealing hidden dependencies. In: Advanced Information Systems Engineering, pp. 83\u201398. Springer (2016)","DOI":"10.1007\/978-3-319-39696-5_6"},{"key":"1069_CR24","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenmeier, N., K\u00e4ppel, M., Petter, S., Sch\u00f6nig, S., Jablonski, S.: Detection of declarative process constraints in LTL formulas. In: EOMAS-15th International Workshop 2019, Selected Papers, LNBIP, vol. 366, pp. 131\u2013145. Springer (2019)","DOI":"10.1007\/978-3-030-35646-0_10"},{"key":"1069_CR25","doi-asserted-by":"publisher","unstructured":"Dijkman, R., Dumas, M., Garc\u00eda-Ba\u00f1uelos, L., K\u00e4\u00e4rik, R.: Aligning business process models, pp. 45\u201353 (2009). https:\/\/doi.org\/10.1109\/EDOC.2009.11","DOI":"10.1109\/EDOC.2009.11"},{"key":"1069_CR26","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: 27th Asia-Pacific Software Engineering Conference (APSEC) (2020)","DOI":"10.1109\/APSEC51365.2020.00008"},{"key":"1069_CR27","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.) Computer Aided Verification. Springer, Berlin (2001)"},{"key":"1069_CR28","unstructured":"Westergaard, M., Stahl, C., Reijers, H.: UnconstrainedMiner: efficient discovery of generalized declarative process models. BPM reports. BPMcenter.org (2013)"},{"key":"1069_CR29","doi-asserted-by":"publisher","unstructured":"Corea, C., Nagel, S., Mendling, J., Delfmann, P.: Interactive and minimal repair of declarative process models, pp. 3\u201319 (2021). https:\/\/doi.org\/10.1007\/978-3-030-85440-9_1","DOI":"10.1007\/978-3-030-85440-9_1"},{"key":"1069_CR30","unstructured":"Hidders, J., Dumas, M., van\u00a0der Aalst, W.M.P., ter Hofstede, A.H.M., Verelst, J.: When are two workflows the same? In: Proceedings of the 2005 Australasian Symposium on Theory of Computing-Volume 41, CATS \u201905, pp. 3\u201311. Australian Computer Society, Inc., Sydney (2005)"},{"key":"1069_CR31","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., Sch\u00f6nig, S., Ackermann, L., Jablonski, S.: Language-independent look-ahead for checking multi-perspective declarative process models. Softw. Syst. Model. 20, 1379\u20131401 (2021)","journal-title":"Softw. Syst. Model."},{"key":"1069_CR32","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":"1069_CR33","unstructured":"Skydanienko, V., Francescomarino, C.D., Maggi, F.: A tool for generating event logs from multi-perspective declare models. In: BPM (Demos) (2018)"},{"key":"1069_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1963190.1963191","volume":"16","author":"L Boytsov","year":"2011","unstructured":"Boytsov, L.: Indexing methods for approximate dictionary searching: comparative analysis. ACM J. Exp. Algorithmics 16, 1 (2011). https:\/\/doi.org\/10.1145\/1963190.1963191","journal-title":"ACM J. Exp. Algorithmics"},{"key":"1069_CR35","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-26619-6_19","volume-title":"Business Process Management","author":"M Camargo","year":"2019","unstructured":"Camargo, M., Dumas, M., Gonz\u00e1lez-Rojas, O.: Learning accurate LSTM models of business processes. In: Hildebrandt, T., van Dongen, B.F., R\u00f6glinger, M., Mendling, J. (eds.) Business Process Management, pp. 286\u2013302. Springer, Cham (2019)"},{"key":"1069_CR36","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 \u201971. ACM, New York (1971)","DOI":"10.1145\/800157.805047"},{"key":"1069_CR37","unstructured":"Maggi, F.M.: Declarative process mining with the declare component of prom. In: Fauvet, M., van Dongen, B.F. (eds.) Proceedings of the BPM Demo sessions 2013, Beijing, China, August 26\u201330, 2013, CEUR Workshop Proceedings, vol. 1021. CEUR-WS.org (2013)"},{"key":"1069_CR38","unstructured":"OMG: Business Process Model and Notation (BPMN), Version 2.0. http:\/\/www.omg.org\/spec\/BPMN\/2.0 (2011)"},{"key":"1069_CR39","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1049\/cje.2016.03.007","volume":"25","author":"Z Duan","year":"2016","unstructured":"Duan, Z., Yu, B., Zhang, C., Tian, C., Ding, M.: A test case generation approach based on sequence diagram and automata models. Chin. J. Electron. 25, 234\u2013240 (2016). https:\/\/doi.org\/10.1049\/cje.2016.03.007","journal-title":"Chin. J. Electron."}],"updated-by":[{"DOI":"10.1007\/s10270-022-01079-w","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T00:00:00Z","timestamp":1672704000000}}],"container-title":["Software and Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-022-01069-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10270-022-01069-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-022-01069-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T02:10:03Z","timestamp":1680228603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10270-022-01069-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,5]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1069"],"URL":"https:\/\/doi.org\/10.1007\/s10270-022-01069-y","relation":{},"ISSN":["1619-1366","1619-1374"],"issn-type":[{"value":"1619-1366","type":"print"},{"value":"1619-1374","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,5]]},"assertion":[{"value":"1 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2023","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10270-022-01079-w","URL":"https:\/\/doi.org\/10.1007\/s10270-022-01079-w","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}