Publication at Faculty of Mathematics and Physics |
2017
Abstract
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.