A structural/temporal query language for business processes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3827232 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4124985 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1754627 (Why is no real title available?)
- scientific article; zbMATH DE number 919850 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- A fixpoint calculus for local and global program flows
- A structural/temporal query language for business processes
- Algebraic automata and context-free sets
- Business processes. A database perspective.
- Developments in Language Theory
- Efficient decision procedures for graph properties on context-free graph languages
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Linear and Context-Free Graph Grammars
- Simplification by Cooperating Decision Procedures
Cited in
(6)- scientific article; zbMATH DE number 2086279 (Why is no real title available?)
- A structural/temporal query language for business processes
- Querying probabilistic business processes for sub-flows
- scientific article; zbMATH DE number 7566047 (Why is no real title available?)
- Query stability in monotonic data-aware business processes
- A query language based on term matching and rewriting
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)