Schedule Optimization of Time Petri Nets Based on Ant Colony Systems

2012 ◽  
Vol 263-266 ◽  
pp. 1733-1739
Author(s):  
Xian Ming Liu ◽  
Li Pan ◽  
Hong Zheng

This paper presents a time Petri net model with the optimizing mechanism based on ant colony systems that addresses the problem of schedule optimization. The choice rules and pheromone update rules of artificial ants are embedded into the evolution rules of a time Petri net, so the modeling and scheduling analysis of real systems can be integrated into the same model. Compared with the approaches based on the heuristic search and genetic algorithms, our method efficiently unifies the modeling and analysis of schedule problems based on a time Petri net.

2020 ◽  
Vol 2 (4) ◽  
pp. 341-354
Author(s):  
Péter Battyányi ◽  
György Vaszil

AbstractWe continue the investigations of the connection between membrane systems and time Petri nets by extending the examined class of systems from simple symbol-object membrane systems to more complex cases: rules with promoters/inhibitors, membrane dissolution, and priority relation on the rules. By constructing the simulating time Petri net, we retain one of the main characteristics of the Petri net model; namely, the firings of the transitions can take place in any order, and there is no need to introduce maximal parallelism in the Petri net semantics. Instead, we substantially exploit the gain in computational strength obtained by the introduction of the timing feature for Petri nets.


2011 ◽  
Vol Volume 14 - 2011 - Special... ◽  
Author(s):  
M. Sogbohossou ◽  
D. Delfieu

International audience For the formal verification of the concurrent or communicating dynamic systems modeled with Petri nets, the method of the unfolding is used to cope with the well-known problem of the state explosion. An extension of the method to the non safe time Petri nets is presented. The obtained unfolding is simply a prefix of that from the underlying ordinary Petri net to the time Petri net. For a certain class of time Petri nets, a finite prefix capturing the state space and the timed language ensues from the calculation of a finite set of finite processes with valid timings. The quantitative temporal constraints associated with these processes can serve to validate more effectively the temporal specifications of a hard real-time system. Pour la vérification formelle des systèmes dynamiques concurrents ou coopérants modélisés à l’aide des réseaux de Petri, la méthode du dépliage est utilisée pour endiguer le phénomène bien connu de l’explosion combinatoire. Une extension de la méthode aux réseaux de Petri temporels à modèle sous-jacent non sauf est présentée. Le dépliage obtenu est simplement un préfixe de celui du réseau de Petri ordinaire sous-jacent au réseau temporel. Pour une certaine classe de réseaux temporels, un préfixe fini capturant l’espace d’état et le langage temporisé découle du calcul d’un ensemble fini de processus finis réalisables. Les contraintes temporelles quantitatives associées à ces processus peuvent servir à valider plus efficacement les spécifications temporelles d’un système temps réel dur.


2006 ◽  
Vol 6 (3) ◽  
pp. 301-320 ◽  
Author(s):  
GUILLAUME GARDEY ◽  
OLIVIER H. ROUX ◽  
OLIVIER F. ROUX

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net. As the method produce a single Timed Automaton, syntactical clocks reduction methods (DAWS and YOVINE for instance) may be applied to produce an automaton with fewer clocks. Then, our method allows to model-check T-TPN by the use of efficient Timed Automata tools.


Author(s):  
Leticia Mara Peres ◽  
Luis Allan Künzle ◽  
Eduardo Todt

This paper presents an application of Global Time technique (GTT) which is an approach to construct class graphs of Time Petri nets based on relative and global time. Besides the constructing of GTT class graph we propose a schedulability analysis of quantitative time type for fixed priority policies and Earliest Deadline First (EDF). We propose that analysis of scenarios, or behavior itineraries duration of a system, can be done using this approach.


2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Parisa Heidari ◽  
Hanifa Boucheneb

Scheduling is often a difficult task specially in complex systems. Few tools are targeted at both modeling and scheduling of the systems. In controller synthesis, a scheduler is seen as a controller to manage shared resources and timing requirements of a system. This paper proposes a time Petri net-based approach for controller synthesis and finding a scheduler using stopwatch. The solution suggested here is particularly interesting for preemptive scheduling purposes. This paper deals with time Petri nets with controllable and uncontrollable transitions and assumes that a controllable transition can be suspended and retrieved when necessary. In fact, the paper supposes that every controllable transition can be associated with stopwatch. With this hypothesis, the objective is to model a system by time Petri nets and calculate subintervals where the system violates the given property. Then, the controller associates the corresponding controllable transitions with stopwatch to suspend them in their bad subintervals. The interesting advantage of this solution is that this approach synthesizes an ordinary time Petri net model before adding stopwatch. Therefore, complicated computations and overapproximations required during controller synthesis of time Petri nets associated with stopwatch are avoided.


2010 ◽  
Vol 33 (5) ◽  
pp. 900-907 ◽  
Author(s):  
Li PAN ◽  
Zhi-Jun DING ◽  
Gang CHEN

2021 ◽  
Vol 1754 (1) ◽  
pp. 012059
Author(s):  
Dongliang Zhang ◽  
Kaiwen Zhang ◽  
Liufeng Wang ◽  
Qinqin Hong

Sign in / Sign up

Export Citation Format

Share Document