Reasoning About Discrete Event Sources
Abstract
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 re-search, 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 in-definite length and show that many interesting cases of such reasoning task are solvable in polynomial time. 1
Cite
Text
Lin. "Reasoning About Discrete Event Sources." AAAI Conference on Artificial Intelligence, 2006.Markdown
[Lin. "Reasoning About Discrete Event Sources." AAAI Conference on Artificial Intelligence, 2006.](https://mlanthology.org/aaai/2006/lin2006aaai-reasoning/)BibTeX
@inproceedings{lin2006aaai-reasoning,
title = {{Reasoning About Discrete Event Sources}},
author = {Lin, Shieu-Hong},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2006},
pages = {868-873},
url = {https://mlanthology.org/aaai/2006/lin2006aaai-reasoning/}
}