Modeling of Timed Petri Nets Using Deterministic (max, +) Automata

Abstract Automata with weights (multiplicities) in (max,+) algebra form a class of timed automata. Determinism is a crucial property for numerous results on (max,+) automata and, in particular, for applications to performance evaluation and control of a large class of timed discrete event systems. In this paper, we show how to build a deterministic (max, +) automaton equivalent to a live and safe timed Petri net in which, between any two transitions, there exists an oriented path which contains at most one “conflict place”

[1]  C. Leake.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[2]  Ines Klimann,et al.  Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton , 2004, Theor. Comput. Sci..

[3]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[4]  Daniel Kirsten,et al.  A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata , 2008, RAIRO Theor. Informatics Appl..

[5]  Gerhard J. Woeginger,et al.  String execution time for finite languages: Max is easy, min is hard , 2011, Autom..

[6]  Jean-Louis Boimond,et al.  Compositions of (max, +) automata , 2015, Discret. Event Dyn. Syst..

[7]  Mehryar Mohri,et al.  Weighted Automata Algorithms , 2009 .

[8]  Jean Mairesse,et al.  Asymptotic behavior in a heap model with two pieces , 2002, Theor. Comput. Sci..

[9]  Jean Mairesse,et al.  Modeling and analysis of timed Petri nets using heaps of pieces , 1997, 1997 European Control Conference (ECC).

[10]  Philippe Darondeau,et al.  Residuation of tropical series: Rationality issues , 2011, IEEE Conference on Decision and Control and European Control Conference.

[11]  Jean Mairesse,et al.  Asymptotic analysis of heaps of pieces and application to timed Petri nets , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[12]  Laurent Houssin,et al.  Cyclic jobshop problem and (max, plus) algebra , 2011 .

[13]  Jean-Louis Boimond,et al.  Supervisory Control of (max,+) Automata: A Behavioral Approach , 2009, Discret. Event Dyn. Syst..

[14]  Jean-Louis Boimond,et al.  New representations for (max, +) automata with applications to the performance evaluation of discrete event systems , 2012, WODES.

[15]  S. Gaubert.  Performance evaluation of (max, +) automata , 1995, IEEE Trans. Autom. Control..