Controlled Timed Petri Nets: Equivalence Relations, Model Reduction

Boel, R.K. and Bordbar, Behzad and Stremersch, G. (1998) Controlled Timed Petri Nets: Equivalence Relations, Model Reduction. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Oct 11-14, 1998, San Diego, CA, . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/ 10.1109/ICSMC.1998.725491

Abstract

Discusses controlled timed Petri net models for the formal synthesis of supervisory controllers for real time discrete event systems (e.g. communication protocols, supervisors for FMSs, control of batch processes). We extend the standard Petri net formalism with firing delays between the time a transition becomes state enabled, and the time it is executed. These firing delays are partly controllable between lower and upper bounds. The goal is to guarantee that certain forbidden distributions of tokens will never occur. For this purpose we define the influencing net corresponding to forbidden sets. Deciding whether a maximally permissive controller exists, and if yes, constructing such a controller, requires solving large sets of linear inequalities over firing times in this influencing net. This is generally a very large set. Hence we study some equivalence relations between different subnets of a timed Petri net. An example shows that replacing a subnet by a simpler equivalent subnet can significantly reduce the size of the sets of inequalities to be solved.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 26 Aug 2009 17:13
Last Modified: 26 Aug 2009 17:13
Resource URI: http://kar.kent.ac.uk/id/eprint/21596 (The current URI for this page, for reference purposes)
  • Depositors only (login required):