메뉴 건너뛰기




Volumn , Issue , 2010, Pages 25-36

On separation of concurrency and conflicts in acyclic process models

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL FLOW GRAPHS; MODULAR DECOMPOSITION; NEW APPROACHES; ORDERING RELATIONS; PROCESS MODEL; PROCESS STRUCTURE TREES;

EID: 81255212649     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (9)
  • 2
    • 38149148011 scopus 로고
    • An O(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs
    • Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, and Stephen J. Sullivan. An O(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. J. Algorithms, 16(2):283-294, 1994.
    • (1994) J. Algorithms , vol.16 , Issue.2 , pp. 283-294
    • Ehrenfeucht, A.1    Gabow, H.N.2    McConnell, R.M.3    Sullivan, S.J.4
  • 9
    • 67349182611 scopus 로고    scopus 로고
    • The refined process structure tree
    • Jussi Vanhatalo, Hagen Völzer, and Jana Koehler. The Refined Process Structure Tree. Data Knowl. Eng., 68(9):793-818, 2009.
    • (2009) Data Knowl. Eng , vol.68 , Issue.9 , pp. 793-818
    • Vanhatalo, J.1    Völzer, H.2    Koehler, J.3


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