Reasoning about partially ordered events
Artificial Intelligence
Principles of computer-integrated manufacturing
Principles of computer-integrated manufacturing
Timing and causality in process algebra
Acta Informatica
Model checking
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Validating plans in the context of processes and exogenous events
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
| Hi-index | 0.00 |
We investigate the modelling of workflows, plans, and other event-generating processes as discrete event sources and reason about the possibility of having event sequences ending in undesirable states. In previous research, the problem is shown to be NP-Complete even if the number of events to occur is fixed in advance. In this paper, we consider possible events sequences of indefinite length and show that many interesting cases of such reasoning task are solvable in polynomial time.