Log-based understanding of business processes through temporal logic query checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8841, Issue , 2014, Pages 75-92

  Räim, Margus ^a   Di Ciccio, Claudio ^b   Maria Maggi, Fabrizio ^a   Mecella, Massimo ^c   Mendling, Jan ^b  

^a UNIVERSITY OF TARTU   (Estonia)

^b VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Business Rules; Linear Temporal Logic; Process Discovery; Temporal Logic Query Checking

Indexed keywords

COMPUTER CIRCUITS; DATA MINING;

BUSINESS PROCESS; BUSINESS RULES; CONFORMANCE CHECKING; LINEAR TEMPORAL LOGIC; PROCESS DISCOVERY; PROCESS MINING; PROCESS MODELING; PROOF OF CONCEPT;

TEMPORAL LOGIC;

EID: 84909992217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-45563-0_5     Document Type: Conference Paper

References (26)

1. 3TU Data Center. BPI Challenge, Event Log (2011), doi:10.4121/uuid:d9769f3d-0ab0-4fb8-803b-0d1120ffcf54
2. Bruns, G., Godefroid, P.; Temporal logic query checking. In: LICS, pp. 409–417. IEEE Computer Society (2001)
3. Chan, W.; Temporal-logic queries. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 450–463. Springer, Heidelberg (2000)
4. Chechik, M., Devereux, B., Easterbrook, S.M., Gurfinkel, A.; Multi-valued symbolic model-checking. ACM Trans. Softw. Eng. Methodol. 12(4), 371–408 (2003)
5. Chechik, M., Easterbrook, S.M., Petrovykh, V.; Model-checking over multi-valued logics. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 72–98. Springer, Heidelberg (2001)
6. 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.) ToPNoC II. LNCS, vol. 5460, pp. 278–295. Springer, Heidelberg (2009)
7. Clarke, E.M., Emerson, E.A., Sistla, A.P.; Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8(2), 244–263 (1986)
8. Clarke, E.M., Grumberg, O., Peled, D.; Model checking. MIT Press (2001)
9. De Giacomo, G., De Masellis, R., Montali, M.; Reasoning on LTL on finite traces: Insensi-tivity to infiniteness. In: AAAI (2014)
10. De Giacomo, G., Vardi, M.Y.; Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI (2013)
11. Deutch, D., Milo, T.; A structural/temporal query language for business processes. J. Com-put. Syst. Sci. 78(2), 583–609 (2012)
12. Di Ciccio, C., Mecella, M.; Mining constraints for artful processes. In: Abramowicz, W., Kriksciuniene, D., Sakalauskas, V. (eds.) BIS 2012. LNBIP, vol. 117, pp. 11–23. Springer, Heidelberg (2012)
13. Di Ciccio, C., Mecella, M.; Studies on the discovery of declarative control flows from error-prone data. In: SIMPDA, pp. 31–45 (2013)
14. Di Ciccio, C., Mecella, M.; A two-step fast algorithm for the automated discovery of declarative workflows. In: CIDM, pp. 135–142. IEEE (2013)
15. Gurfinkel, A., Chechik, M., Devereux, B.; Temporal logic query checking: A tool for model exploration. IEEE TSE 29(10), 898–914 (2003)
16. 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-7), 164–185 (2013)
17. Kupferman, O., Vardi, M.Y., Wolper, P.; An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312–360 (2000)
18. Lamma, E., Mello, P., Riguzzi, F., Storari, S.; Applying inductive logic programming to process mining. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 132–146. Springer, Heidelberg (2008)
19. Maggi, F.M., Burattin, A., Cimitile, M., Sperduti, A.; Online process discovery to detect concept drifts in LTL-based declarative process models. In: Meersman, R., Panetto, H., Dillon, T., Eder, J., Bellahsene, Z., Ritter, N., De Leenheer, P., Dou, D. (eds.) ODBASE 2013. LNCS, vol. 8185, pp. 94–111. Springer, Heidelberg (2013)
20. 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: Ralyte´, J., Franch, X., Brinkkemper, S., Wrycza, S. (eds.) CAiSE 2012. LNCS, vol. 7328, pp. 270–285. Springer, Heidelberg (2012)
21. Maggi, F.M., Dumas, M., García-Bañuelos, L., Montali, M.; Discovering data-aware declarative process models from event logs. In: Daniel, F., Wang, J., Weber, B. (eds.) BPM 2013. LNCS, vol. 8094, pp. 81–96. Springer, Heidelberg (2013)
22. Maggi, F.M., Mooij, A.J., van der Aalst, W.M.P.; User-guided discovery of declarative process models. In: CIDM, pp. 192–199. IEEE (2011)
23. Pesic, M., Schonenberg, H., van der Aalst, W.M.P.; Declare: Full support for loosely-structured processes. In: EDOC, pp. 287–300. IEEE (2007)
24. Pnueli, A.; The temporal logic of programs. In: FSTTCS, pp. 46–57. IEEE (1977)
25. van Dongen, B.F., de Medeiros, A.K.A., Verbeek, H.M.W., Weijters, A.J.M.M.T., van der Aalst, W.M.P.; The ProM framework: A new era in process mining tool support. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 444–454. Springer, Heidelberg (2005)
26. Weidlich, M., Mendling, J., Weske, M.; Efficient consistency measurement based on behavioral profiles of process models. IEEE Trans. Software Eng. 37(3), 410–429 (2011)