Leveraging Game-Tree Search for Robust Process Enactment
| Autor: | Hoa Khanh Dam, Aditya Ghose, Yingzhi Gou |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Decision points
Adversarial system Theoretical computer science Computer science 020204 information systems Monte Carlo method 0202 electrical engineering electronic engineering information engineering Process (computing) 020207 software engineering 02 engineering and technology Evaluation function Minimax search Game tree search |
| Zdroj: | Advanced Information Systems Engineering ISBN: 9783319595351 CAiSE |
| DOI: | 10.1007/978-3-319-59536-8_29 |
| Popis: | A robust machinery for process enactment should ideally be able to anticipate and account for possible ways in which the execution environment might impede a process from achieving its desired effects or outcomes. At critical decision points in a process, it is useful for the enactment machinery to compute alternative flows by viewing the problem as an adversarial game pitting the process (or its enactment machinery) against the process execution environment. We show how both minimax search and Monte Carlo game tree search, coupled with a novel conception of an evaluation function, delivers useful results. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|