A structural/temporal query language for business processes
DOI10.1016/J.JCSS.2011.09.004zbMATH Open1242.68088OpenAlexW2099873140MaRDI QIDQ414923FDOQ414923
Authors: 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
Recommendations
Management decision making, including multiple objectives (90B50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)
Cites Work
- Title not available (Why is that?)
- Simplification by Cooperating Decision Procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Title not available (Why is that?)
- A fixpoint calculus for local and global program flows
- Business processes. A database perspective.
- Title not available (Why is that?)
- A structural/temporal query language for business processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient decision procedures for graph properties on context-free graph languages
- Algebraic automata and context-free sets
- Linear and Context-Free Graph Grammars
- Developments in Language Theory
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: A structural/temporal query language for business processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414923)
