A structural/temporal query language for business processes
From MaRDI portal
Publication:414923
DOI10.1016/j.jcss.2011.09.004zbMath1242.68088MaRDI QIDQ414923
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
68P15: Database theory
90B50: Management decision making, including multiple objectives
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item