von Drathen, Arne (Hamburg Univ. of Tech.)

Representing Composition Operators of Automata by Petri Nets

Scheduled for presentation during the Mini-Symposium "Formal Methods for Discrete-Event Systems" (ThP10), Thursday, July 27, 2006, 15:45−16:10, Room 103

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 19, 2024

Abstract

Wonham's supervisory control theory (SCT) holds some composition operations defined on automata. In this paper, we show how to implement some of these composition operators on coloured Petri nets. With coloured Petri nets it is possible to represent the behaviour of a table or database by using initial markings. We use this property to map the table representation of an arbitrary large automaton to an equivalent coloured Petri net which consists of one transition and several places. After transforming the elementary automata into equivalent Petri nets, the composition can be applied to the Petri nets. The reachability graph of the combined Petri net is equivalent to the automaton which is obtained composing the elementary automata. If only the controlled behaviour of a composed net is requested but not the whole automata graph, the Petri net representation is an alternative and saves computing time, since the calculation of the composed automaton can be avoided.