COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS

DOI10.1142/S0129054106003784MaRDI QIDQ3379523zbMATH OpenFDO

Authors Shiyong Lu, Arthur Bernstein, Philip M. Lewiserratum

Publication date 6 April 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

completenessconcurrencyworkflowsemantic correctness

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Production models (90B30)

Recommendations

• Automatic workflow verification and generation
• scientific article; zbMATH DE number 1945823
• An algebraic analysis of workflows
• Applications of propositional logic to workflow analysis
• Verification problems in conceptual workflow specifications

Cites work

• scientific article; zbMATH DE number 1531968 (Why is no real title available?)
• Fast planning through planning graph analysis
• The computational complexity of propositional STRIPS planning

Cited in

(3)

• Applications of propositional logic to workflow analysis
• Automatic workflow verification and generation
• scientific article; zbMATH DE number 1945823 (Why is no real title available?)

This page was built for publication: COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379523)