메뉴 건너뛰기




Volumn 4797 LNCS, Issue , 2007, Pages 169-185

Querying structural and behavioral properties of business processes

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS;

EID: 38449113336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75987-4_12     Document Type: Conference Paper
Times cited : (11)

References (26)
  • 3
    • 85032269521 scopus 로고
    • Nested Relations and Complex Objects in Databases
    • Springer, Heidelberg
    • Abiteboul, S., Fischer, P.C., Schek, H.J.: Nested Relations and Complex Objects in Databases. LNCS, vol. 361. Springer, Heidelberg (1989)
    • (1989) LNCS , vol.361
    • Abiteboul, S.1    Fischer, P.C.2    Schek, H.J.3
  • 10
    • 85029621995 scopus 로고
    • Model checking for context-free processes
    • Cleaveland, W.R, ed, CONCUR 1992, Springer, Heidelberg
    • Burkart, O., Steffen, B.: Model checking for context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, Springer, Heidelberg (1992)
    • (1992) LNCS , vol.630
    • Burkart, O.1    Steffen, B.2
  • 11
    • 1142291570 scopus 로고    scopus 로고
    • Xquery: A query language for xml
    • Chamberlin, D.: Xquery: a query language for xml. In: Proc. of SIGMOD (2003)
    • (2003) Proc. of SIGMOD
    • Chamberlin, D.1
  • 14
    • 0025398865 scopus 로고
    • The monadic second-order logic of graphs
    • Courcellc, B.: The monadic second-order logic of graphs. Inf. Comput. 85(1) (1990)
    • (1990) Inf. Comput , vol.85 , Issue.1
    • Courcellc, B.1
  • 15
    • 38449123144 scopus 로고    scopus 로고
    • Verification of communicating data-driven web services
    • Deutsch, A., Sui, L., Vianu, V., Zhou, D.: Verification of communicating data-driven web services. In: Proc. of PODS (2006)
    • (2006) Proc. of PODS
    • Deutsch, A.1    Sui, L.2    Vianu, V.3    Zhou, D.4
  • 19
    • 0043027618 scopus 로고    scopus 로고
    • Parameterized complexity for the database theorist
    • Grohe, M.: Parameterized complexity for the database theorist. SIGMOD Rec. 31(4) (2002)
    • (2002) SIGMOD Rec , vol.31 , Issue.4
    • Grohe, M.1
  • 20
    • 38449122273 scopus 로고
    • Graph grammars with node-label controlled rewriting and embedding
    • Janssens, D., Rozenberg, G.: Graph grammars with node-label controlled rewriting and embedding. In: Proc. of COMPUGRAPH (1983)
    • (1983) Proc. of COMPUGRAPH
    • Janssens, D.1    Rozenberg, G.2
  • 22
    • 0027574356 scopus 로고
    • Efficient decision procedures for graph properties on context-free graph languages
    • Lengauer, T., Wanke, E.: Efficient decision procedures for graph properties on context-free graph languages. J. ACM 40(2) (1993)
    • (1993) J. ACM , vol.40 , Issue.2
    • Lengauer, T.1    Wanke, E.2
  • 24
    • 0015283919 scopus 로고
    • Linear and context-free graph grammars
    • Pavlidis, T.: Linear and context-free graph grammars. J. ACM 19(1) (1972)
    • (1972) J. ACM , vol.19 , Issue.1
    • Pavlidis, T.1
  • 25
    • 0030172286 scopus 로고    scopus 로고
    • Logic based programmed structure rewriting systems
    • Schurr, A.: Logic based programmed structure rewriting systems. Fundam. Inf. 26(3-4) (1996)
    • (1996) Fundam. Inf , vol.26 , Issue.3-4
    • Schurr, A.1
  • 26
    • 84900354372 scopus 로고    scopus 로고
    • The World Wide Web Consortium
    • The World Wide Web Consortium, http://www.w3.org/


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