메뉴 건너뛰기




Volumn 25, Issue 1, 2013, Pages 192-205

Region-based foldings in process discovery

Author keywords

Process discovery; region theory; transition system folding

Indexed keywords

CENTRAL PROBLEMS; CYCLE DETECTION; FOLDINGS; FORMAL MODEL; IN-PROCESS; INDUSTRIAL SCENARIOS; PROCESS DISCOVERY; PROCESS MINING; REGION INFORMATION; REGION THEORY; REGION-BASED; THEORY OF REGIONS; TRANSITION SYSTEM;

EID: 84870430898     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2011.192     Document Type: Article
Times cited : (23)

References (36)
  • 2
    • 4544353101 scopus 로고    scopus 로고
    • Workflow mining: Discovering process models from event logs
    • Sept.
    • W. van der Aalst, T. Weijters, and L. Maruster, "Workflow Mining: Discovering Process Models from Event Logs," IEEE Trans. Knowledge Data Eng., vol. 16, no. 9, pp. 1128-1142, Sept. 2004.
    • (2004) IEEE Trans. Knowledge Data Eng. , vol.16 , Issue.9 , pp. 1128-1142
    • Aalst Der W.Van1    Weijters, T.2    Maruster, L.3
  • 4
    • 84883435609 scopus 로고    scopus 로고
    • Mining process models with non-free-choice constructs
    • DOI 10.1007/s10618-007-0065-y
    • L. Wen, W. van der Aalst, J. Wang, and J. Sun, "Mining Process Models with Non-Free-Choice Constructs," Data Mining and Knowledge Discovery, vol. 15, no. 2, pp. 145-180, 2007. (Pubitemid 47293485)
    • (2007) Data Mining and Knowledge Discovery , vol.15 , Issue.2 , pp. 145-180
    • Wen, L.1    Van Der Aalst, W.M.P.2    Wang, J.3    Sun, J.4
  • 6
    • 0025405313 scopus 로고
    • Partial (Set) 2-structures. Part I, II
    • A. Ehrenfeucht and G. Rozenberg, "Partial (Set) 2-Structures. Part I, II," Acta Informatica, vol. 27, pp. 315-368, 1990.
    • (1990) Acta Informatica , vol.27 , pp. 315-368
    • Ehrenfeucht, A.1    Rozenberg, G.2
  • 8
    • 58149528197 scopus 로고    scopus 로고
    • Synthesis of petri nets from finite partial languages
    • R. Bergenthum, J. Desel, R. Lorenz, and S. Mauser, "Synthesis of Petri Nets from Finite Partial Languages," Fundamental Information, vol. 88, no. 4, pp. 437-468, 2008.
    • (2008) Fundamental Information , vol.88 , Issue.4 , pp. 437-468
    • Bergenthum, R.1    Desel, J.2    Lorenz, R.3    Mauser, S.4
  • 10
    • 76549086747 scopus 로고    scopus 로고
    • New region-based algorithms for deriving bounded petri nets
    • Mar.
    • J. Carmona, J. Cortadella, and M. Kishinevsky, "New Region- Based Algorithms for Deriving Bounded Petri Nets," IEEE Trans. Computers, vol. 59, no. 3, pp. 371-384, Mar. 2010.
    • (2010) IEEE Trans. Computers , vol.59 , Issue.3 , pp. 371-384
    • Carmona, J.1    Cortadella, J.2    Kishinevsky, M.3
  • 17
    • 0024645936 scopus 로고
    • Petri nets: Properties, analysis and applications
    • Apr.
    • T. Murata, "Petri Nets: Properties, Analysis and Applications," Proc. IEEE, vol. 77, no. 4, pp. 541-580, Apr. 1989.
    • (1989) Proc. IEEE , vol.77 , Issue.4 , pp. 541-580
    • Murata, T.1
  • 18
    • 0030533613 scopus 로고    scopus 로고
    • The synthesis problem of Petri nets
    • J. Desel and W. Reisig, "The Synthesis Problem of Petri Nets," Acta Informatica, vol. 33, no. 4, pp. 297-315, 1996. (Pubitemid 126331525)
    • (1996) Acta Informatica , vol.33 , Issue.4 , pp. 297-315
    • Desel, J.1    Reisig, W.2
  • 19
    • 0000873334 scopus 로고
    • Petri nets and step transition systems
    • M. Mukund, "Petri Nets and Step Transition Systems," Foundations of Comp. Science, vol. 3, no. 4, pp. 443-478, 1992.
    • (1992) Foundations of Comp. Science , vol.3 , Issue.4 , pp. 443-478
    • Mukund, M.1
  • 21
    • 74049086441 scopus 로고    scopus 로고
    • Process discovery and petri nets
    • N. Busi and G.M. Pinna, "Process Discovery and Petri Nets," Math. Structures in Computer Science, vol. 19, no. Special Issue 06, pp. 1091-1124, 2009.
    • (2009) Math. Structures in Computer Science , vol.19 , Issue.SPECIAL ISSUE 06 , pp. 1091-1124
    • Busi, N.1    Pinna, G.M.2
  • 22
    • 0040880105 scopus 로고    scopus 로고
    • Theory of Regions
    • Lectures on Petri Nets I: Basic Models. Advances in Petri Nets
    • E. Badouel and P. Darondeau, "Theory of Regions," Lectures on Petri Nets I: Basic Models, pp. 529-586, Springer, 1998. (Pubitemid 128165820)
    • (1998) Lecture notes in computer science , Issue.1491 , pp. 529-586
    • Badouel, E.1    Darondeau, P.2
  • 23
    • 26844524061 scopus 로고    scopus 로고
    • Online and dynamic recognition of squarefree strings
    • Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005. Proceedings
    • J. Jansson and Z. Peng, "Online and Dynamic Recognition of Squarefree Strings," Math. Foundation of Comp. Science, vol. 3618/ 2005, pp. 520-531, 2005. (Pubitemid 41449526)
    • (2005) Lecture Notes in Computer Science , vol.3618 , pp. 520-531
    • Jansson, J.1    Peng, Z.2
  • 25
    • 0001338917 scopus 로고
    • An o(n log n) algorithm for finding all repetitions in a string
    • M.G. Main and R.J. Lorentz, "An o(n log n) Algorithm for Finding all Repetitions in a String," J. Algorithms, vol. 5, no. 3, pp. 422-432, 1984.
    • (1984) J. Algorithms , vol.5 , Issue.3 , pp. 422-432
    • Main, M.G.1    Lorentz, R.J.2
  • 26
    • 49049125709 scopus 로고
    • Optimal off-line detection of repetitions in a string
    • A. Apostolico and F.P. Preparata, "Optimal Off-Line Detection of Repetitions in a String," Theoretical Computer Science, vol. 22, no. 3, pp. 297-315, 1983.
    • (1983) Theoretical Computer Science , vol.22 , Issue.3 , pp. 297-315
    • Apostolico, A.1    Preparata, F.P.2
  • 28
    • 6344252888 scopus 로고    scopus 로고
    • Linear time algorithms for finding and representing all the tandem repeats in a string
    • D. Gusfield and J. Stoye, "Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String," J. Computer and System Sciences, vol. 69, no. 4, pp. 525-546, 2004.
    • (2004) J. Computer and System Sciences , vol.69 , Issue.4 , pp. 525-546
    • Gusfield, D.1    Stoye, J.2
  • 35
    • 33746334454 scopus 로고    scopus 로고
    • Discovering expressive process models by clustering log traces
    • DOI 10.1109/TKDE.2006.123, 1644726
    • G. Greco, A. Guzzo, L. Pontieri, and D. Saccà, "Discovering Expressive Process Models by Clustering Log Traces," IEEE Trans. Knowledge Data Eng., vol. 18, no. 8, pp. 1010-1027, Aug. 2006. (Pubitemid 44109532)
    • (2006) IEEE Transactions on Knowledge and Data Engineering , vol.18 , Issue.8 , pp. 1010-1027
    • Greco, G.1    Guzzo, A.2    Pontieri, L.3    Sacca, D.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.