Analyzing the dynamics of discrete deterministic systems

Abstract

This work is based on an extension of the Petri net framework. Our model relies on the definition of a priority relation between conflicting transitions, which is encoded in a compact manner by orienting the edges of a transition conflict graph. The benefit is that this allows the use of a successor function for the study of dynamic processes from a global point of view, independent from a particular initial state and the (complete) construction of the reachability graph. We address the problem of gaining the information that allows to provide an appropriate priority relation governing the dynamic behavior of the studied system and discuss some further implications and generalizations of the studied approach.