A structural/temporal query language for business processes

DOI10.1016/J.JCSS.2011.09.004zbMath1242.68088OpenAlexW2099873140MaRDI QIDQ414923

Daniel Deutch, Tova Milo

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.09.004

zbMATH Keywords

query languagesbusiness processes

Mathematics Subject Classification ID

Database theory (68P15) Management decision making, including multiple objectives (90B50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A structural/temporal query language for business processes ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A structural/temporal query language for business processes
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Business Processes: A Database Perspective
• Simplification by Cooperating Decision Procedures
• Efficient decision procedures for graph properties on context-free graph languages
• A fixpoint calculus for local and global program flows
• Algebraic automata and context-free sets
• Linear and Context-Free Graph Grammars
• Developments in Language Theory

This page was built for publication: A structural/temporal query language for business processes