Recently, attribute grammars have been suggested as a unifying framework to describe workflow and planning domains models. One of the critical aspects of the domain model is its soundness, that is, the model should not contain any dead-ends and should describe at least one plan. In this paper we describe how the domain model can be verified by using the concept of reduction of attribute grammars. Two verification methods are suggested, one based on transformation to context-free grammars and one direct method exploiting constraint satisfaction.
CITATION STYLE
Barták, R., & Dvořák, T. (2017). On verification of workflow and planning domain models using attribute grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10061 LNAI, pp. 332–345). Springer Verlag. https://doi.org/10.1007/978-3-319-62434-1_28
Mendeley helps you to discover research relevant for your work.