Reachability Graph for Autonomous Continuous Petri Nets

2004 ◽  
pp. 63-70 ◽  
Author(s):  
René David ◽  
Hassane Alla
Keyword(s):  
Petri Nets ◽  
Reachability Graph ◽  
Continuous Petri Nets

scholarly journals Thermal-aware Real-time Scheduling Using Timed Continuous Petri Nets

2019 ◽  
Vol 18 (4) ◽  
pp. 1-24 ◽  
Author(s):  
G. Desirena-López ◽  
A. Ramírez-Treviño ◽  
J. L. Briz ◽  
C. R. Vázquez ◽  
D. Gómez-Gutiérrez
Keyword(s):  
Petri Nets ◽  
Real Time ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Continuous Petri Nets

Structural and generic conditions for controllability of timed continuous Petri nets

2012 ◽  
Vol 45 (29) ◽  
pp. 41-46
Author(s):  
C. Renato Vázquez ◽  
Antonio Ramírez-Treviño
Keyword(s):  
Petri Nets ◽  
Continuous Petri Nets

Asymptotic continuous Petri nets

1993 ◽  
Vol 2 (3-4) ◽  
pp. 235-263 ◽  
Author(s):  
Jean Le Bail ◽  
Hassane Alla ◽  
René David
Keyword(s):  
Petri Nets ◽  
Continuous Petri Nets

Symmetries in timed continuous Petri nets

2011 ◽  
Vol 5 (2) ◽  
pp. 125-135 ◽  
Author(s):  
A. Meyer ◽  
M. Dellnitz ◽  
M. Hessel-von Molo
Keyword(s):  
Petri Nets ◽  
Continuous Petri Nets

scholarly journals Approximations of Stochastic Nets by Mean of Continuous Petri Nets

2016 ◽  
Vol 155 (4) ◽  
pp. 26-31
Author(s):  
Nabil El ◽  
Souâd Choukrad
Keyword(s):  
Petri Nets ◽  
Continuous Petri Nets

Parallel computation of continuous Petri nets based on hypergraph partitioning

2011 ◽  
Vol 62 (1) ◽  
pp. 345-377
Author(s):  
Zuohua Ding ◽  
Hui Shen ◽  
Jianwen Cao
Keyword(s):  
Petri Nets ◽  
Parallel Computation ◽  
Hypergraph Partitioning ◽  
Continuous Petri Nets

Algorithms of reduced complexity to design control sequences for untimed Petri nets in varying and uncertain environments

2018 ◽  
Vol 232 (6) ◽  
pp. 638-651
Author(s):  
Dimitri Lefebvre
Keyword(s):  
Petri Nets ◽  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Discrete Event ◽  
Sufficient Conditions ◽  
Reference Value ◽  
Computational Effort ◽  
Scheduling Problems ◽  
Reachability Graph ◽  
Control Sequences

Petri nets have been widely used for the modelling, analysis, control and optimization of discrete event systems with shared resources in the domains of engineering. This article concerns the design of control sequences for such systems modelled with untimed Petri nets. The aim of the controller is to incrementally compute sequences of transition firings with minimal size. Such sequences aim to move the marking from an initial value to a reference value. The resulting trajectory must avoid some forbidden markings and limit as possible the exploration of non-promising branches. For this purpose, the approach explores a small part of the reachability graph in the neighbourhood of the current marking. Then from the explored markings, it estimates a distance to the reference. The main contributions are (a) to reduce the explored part of the reachability graph according to a double limitation in breadth and in depth in order to provide solutions with a low computational effort; (b) to provide conditions to ensure the converge and optimality of the proposed algorithms and derive necessary and sufficient conditions for reachability; and (c) to include the firing sequence design in a global control schema suitable for reactive scheduling problems in uncertain and perturbed environments. The main application concerns deadlock-free scheduling problems in the domain of flexible manufacturing systems, but the approach is also applicable for systems in computer science and transportation.

Sign in / Sign up

Export Citation Format

Share Document