COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS

DOI10.1142/S0129054106003784zbMATH Open1088.90520MaRDI QIDQ3379523FDOQ3379523

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)

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

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)

Cites Work

• Fast planning through planning graph analysis
• The computational complexity of propositional STRIPS planning
• Title not available (Why is that?)

Cited In (3)

• Applications of propositional logic to workflow analysis
• Automatic workflow verification and generation
• Title not available (Why is that?)

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)