Skip to main content
placeholder image

Leveraging game-tree search for robust process enactment

Journal Article


Abstract


  • © Springer International Publishing AG 2017.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.

Publication Date


  • 2017

Citation


  • Gou, Y., Ghose, A. & Dam, H. (2017). Leveraging game-tree search for robust process enactment. Lecture Notes in Computer Science, 10253 461-476.

Scopus Eid


  • 2-s2.0-85021247744

Number Of Pages


  • 15

Start Page


  • 461

End Page


  • 476

Volume


  • 10253

Place Of Publication


  • Germany

Abstract


  • © Springer International Publishing AG 2017.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.

Publication Date


  • 2017

Citation


  • Gou, Y., Ghose, A. & Dam, H. (2017). Leveraging game-tree search for robust process enactment. Lecture Notes in Computer Science, 10253 461-476.

Scopus Eid


  • 2-s2.0-85021247744

Number Of Pages


  • 15

Start Page


  • 461

End Page


  • 476

Volume


  • 10253

Place Of Publication


  • Germany