Synthesis of Controllers of Processes Modeled as ColoredPetri Nets

  • Authors:
  • Mbi Makungu;Michel Barbeau;Richard St-Denis

  • Affiliations:
  • Département de mathématiques et d‘informatique, Université de Sherbrooke, Sherbrooke (Québec) CANADA J1K 2R1;Département de mathématiques et d‘informatique, Université de Sherbrooke, Sherbrooke (Québec) CANADA J1K 2R1;Département de mathématiques et d‘informatique, Université de Sherbrooke, Sherbrooke (Québec) CANADA J1K 2R1

  • Venue:
  • Discrete Event Dynamic Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an adaptation of a supervisorycontrol theory and a supervisor synthesis problem to a classof colored Petri nets. More specifically, the forbidden statecontrol problem with full observation, in which a discrete-eventsystem is modeled as a colored Petri net with a symmetry specification,is investigated. This problem is decidable if the colored Petrinet has finite color sets and bounded places. A new algorithmfor deriving a controller is presented in detail with a proofof correctness. Unlike conventional algorithms that explore theentire reachable set of states, our algorithm avoids an exhaustivesearch of the state space by exploiting a symmetry specification.It performs particularly well when applied to large but structuredprocesses with similar components. Furthermore, this approachleads to a representation of controllers which are smaller thanthose obtained with automaton-based approaches.