Abstract
The aim of this paper is to present a way to calculate a complexity measurement of graph grammar specifications of reactive systems. The basic operation that describe the behavior of a graph grammar is a rule application. Therefore, this operation will be used to characterize the tasks to be performed within a system. The complexity measurement defined here ,vill give us the minimum numbei:· of steps that must be present in a computation that performs a desir_ed task.
En
Revista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 7, n. 1 (set. 2000), p. 109-128.
