2000 character limit reached
Analysis of P-time Event Graphs in (Max,+) and (Min,+) Algebras
Published 10 Mar 2020 in eess.SY and cs.SY | (2003.04703v1)
Abstract: In this work we investigate the behavior of P-time event graphs, a class of time Petri nets with nondeterministic timing of places. Our approach is based on combined linear descriptions in both (max,+) and (min,+) semirings, where lower bounds on the state vector are (max,+)-linear and upper bounds are (min,+)-linear. We present necessary and sufficient conditions for the existence of extremal (fastest and slowest) periodic trajectories that are derived from the new description. The results are illustrated by a realistic example of an electroplating process.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.