Partial Languages and Their Application to Theoy of Discrete Event Systems

Abstract

A discrete event system is a dynamical system which evolves according to asynchronous, concurrent and sequential occurrence of discrete state changes. Petri nets are a promising mathematical tool for modeling and analysis of discrete event systems. Partial languages give a correct description of how Petri nets behave. In this paper, we first review partial languages and show that they are useful for analysis of Petri nets. We then propose a synthesis of condition/event nets (a subclass of Petri nets), in which the objective is to construct a net to exhibit the desired behavior specified as a partial language. We last discuss the outline of a synthesis technique.