Complexity analysis of reactive graph grammars.
Aline Brum Loreto, Laira Vieira Toscani, Leila Ribeiro · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2000
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.