COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS

DOI10.1142/S0129054106003784zbMath1088.90520MaRDI QIDQ3379523

Philip M. Lewiserratum, Shiyong Lu, Arthur Bernstein

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) Production models (90B30) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cites Work

• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• Unnamed Item

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