ALGEBRAIC TECHNIQUES FOR THE ANALYSIS AND CONTROL OF NETWORKS PETRI CONTINUING.Author:
JÚLVEZ BUENO JORGE EMILIO.
Year:
2004.
University:
ZARAGOZA [
www.unizar.es].
Place of defense: CENTRO POLITÉCNICO SUPERIOR.
Place of preparation: CENTRO POLITÉCNICO SUPERIOR.
Summary: The Petri nets are a powerful formalism for the modeling and analysis of competing systems. Traditionally, Petri nets have been used in the context of discrete systems. One of the biggest problems that appear in discrete systems is the highly populated state of the explosion: The number of states in the system grows exponentially with respect to its initial population. The fluidificación or continuización is a classic relaxation technique whose goal is to prevent the emergence of this problem. This work is devoted to the study of Petri nets continuing. In a Petri net continuous firing transitions is not restricted to the set of natural numbers but the real positive. Thus, the state marked a continuous network is given by an array of real numbers. In Petri nets continuing the state space is achievable convex which allows the use of linear techniques rather than whole. This impacts positively on the very complexity of the verification algorithms. Unfortunately, Petri net fluidificada not always preserves properties of the original discrete network. For example, the vivacity of discrete network is not sufficient nor necessary for the vivacity of the network fluidificada. This and other discrepancies between the discrete networks and their fluidificadas suggest that Petri nets require a continuous and rigorous independent study. This document covers both networks continual not timed as timed. The main properties are studied in networks are not timed reachability and vivacity. With regard to networks timed topics investigated are related to alertness, performance appraisal, observabilidad and controllability.
