Learn More
A class of synchronized queueing networks with deterministic routing is identiied to be equivalent to a subclass of timed Petri nets called marked graphs. First some structural and behavioral properties of marked graphs are recalled and used to show interesting properties of this class of performance models. In particular, ergodicity is derived from(More)
This paper addresses the optimal control problem of continuous Petri nets under infinite servers semantics. Our goal is to find a control input optimizing a certain cost function that permits the evolution from an initial marking to a desired configuration. The problem is studied through Model Predictive Control (MPC), a control method, extensively used in(More)
One of the indigenous techniques for the analysis of Petri Net system models is based on its non-negative state equation, bridging convex goemetry and linear programming theories to the theory of Petri Nets. This invited survey brieey overviews some recent developments in the use of linear algebraic techniques for the qualitative (i.e., logical) and(More)
This paper addresses a sampling problem for timed continuous Petri nets under infinite servers semantics. Different representations of the continuous Petri net system are given, the first two in terms of piecewise linear system and the third one, for the controlled continuous Petri nets systems, in terms of a particular linear constrained system with null(More)
Continuous Petri nets were introduced as an approximation to deal with the state explosion problem which can appear in discrete event models. When time is introduced, the flow through a fluidified transition can be defined in many ways. The most used in literature are infinite and finite servers semantics. Both can be seen as derived from stochastic Petri(More)
A timed distributed continuous Petri net system (DcontPN) is composed of several subsystems which communicate through channels modeled by places. In this work, a reachability control problem for DcontPNs composed of two subsystems is considered. An algorithm is developed to calculate the control inputs for each subsystem. The application of the obtained(More)
We concentrate on a family of discrete event systems obtained from a simple modular design principle that include in a controlled way primitives to deal with concurrency, decisions, synchronization, blocking , and bulk movements of jobs. Due to the functional complexity of such systems, reliable throughput approximation algorithms must be deeply supported(More)
A Lyapunov-function-based control algorithm is proposed for timed continuous Petri Net (contPN) systems working under infinite servers semantics. A timed contPN is a switched linear system and its control signal must be non-negative and upper bounded by a function of system states. An input variable transformation is applied to convert the system to a set(More)