An improved approach for marking optimization of timed weighted marked graphs

Timed weighted marked graphs are a mathematical formalism suitable to model automated manufacturing systems in which synchronization and bulk services and arrivals appear, such as assembly lines and kanban systems. In this paper, we aim to develop practically efficient methods for the marking optimization of timed weighted marked graphs, a problem which consists in finding an initial resource assignment to minimize the cost of resources under a given requirement on the cycle time. Starting with a live initial marking, we first compute the critical places of a timed weighted marked graph by exploring an equivalent model called timed marked graph. Then, we develop an analytical method to identify the critical circuit of the system to which tokens will be iteratively added. Application to a real manufacturing system is finally provided, which shows that the developed approach is significantly more efficient than the existing ones.

[1]  Manuel Silva Suárez,et al.  On Weighted T-Systems , 1992, Application and Theory of Petri Nets.

[2]  Alessandro Giua,et al.  Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints , 2015, IEEE Trans. Autom. Control..

[3]  MengChu Zhou,et al.  Deadlock and liveness characterization for a class of generalized Petri nets , 2017, Inf. Sci..

[4]  Robert de Simone,et al.  Periodic scheduling of marked graphs using balanced binary words , 2012, Theor. Comput. Sci..

[5]  Sander Stuijk,et al.  Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[6]  Carla Seatzu,et al.  Control of Discrete-Event Systems , 2012, Lecture Notes in Control and Information Sciences.

[7]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[8]  Morikazu Nakamura,et al.  An iterative linear relaxation and tabu search approach to minimum initial marking problems of timed marked graphs , 1999, 1999 European Control Conference (ECC).

[9]  Olivier Marchetti,et al.  Complexity results for Weighted Timed Event Graphs , 2010, Discret. Optim..

[10]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[11]  Edward A. Lee,et al.  Synthesis of Embedded Software from Synchronous Dataflow Specifications , 1999, J. VLSI Signal Process..

[12]  Sander Stuijk,et al.  Throughput Analysis of Synchronous Data Flow Graphs , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[13]  Alessandro Giua,et al.  Marking optimization of deterministic timed weighted marked graphs under infinite server semantics , 2016, 2016 International Conference on Control, Decision and Information Technologies (CoDIT).

[14]  Zhiwu Li,et al.  Cycle Time Optimization of Deterministic Timed Weighted Marked Graphs by Transformation , 2015, IEEE Transactions on Control Systems Technology.

[15]  Alessandro Giua,et al.  Performance Optimization for Timed Weighted Marked Graphs Under Infinite Server Semantics , 2018, IEEE Transactions on Automatic Control.

[16]  Alessandro Giua,et al.  Firing rate optimization of cyclic timed event graphs by token allocations , 2002, Autom..

[17]  Alessandro Giua,et al.  Current-state opacity enforcement in discrete event systems under incomparable observations , 2018, Discret. Event Dyn. Syst..

[18]  Bertrand Cottenceau,et al.  Modeling and Control of Weight-Balanced Timed Event Graphs in Dioids , 2014, IEEE Transactions on Automatic Control.

[19]  Shuvra S. Bhattacharyya,et al.  Embedded Multiprocessors: Scheduling and Synchronization , 2000 .

[20]  Guang R. Gao,et al.  Rate-optimal schedule for multi-rate DSP computations , 1995, J. VLSI Signal Process..

[21]  Xiaolan Xie,et al.  Marking Optimization In Timed Event Graphs , 1991, Applications and Theory of Petri Nets.

[22]  Alessandro Giua,et al.  On the Equivalence of Observation Structures for Petri Net Generators , 2016, IEEE Transactions on Automatic Control.

[23]  Manuel Silva,et al.  Cycle time computation in deterministically timed weighted marked graphs , 1999, 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).

[24]  Giovanni Chiola,et al.  Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector , 1991, IEEE Trans. Software Eng..

[25]  Alessandro Giua,et al.  Characterization of Admissible Marking Sets in Petri Nets With Conflicts and Synchronizations , 2017, IEEE Transactions on Automatic Control.

[26]  Nathalie Sauer.  Marking Optimization of Weighted Marked Graphs , 2003, Discret. Event Dyn. Syst..

[27]  Alessandro Giua,et al.  Optimization of deterministic timed weighted marked graphs , 2017, 2017 13th IEEE Conference on Automation Science and Engineering (CASE).

[28]  Alessandro Giua,et al.  HYPENS: A Matlab Tool for Timed Discrete, Continuous and Hybrid Petri Nets , 2008, Petri Nets.