A Translation Based Method for the Timed Analysis of Scheduling Extended Time Petri Nets

Lime, Didier; Roux, Olivier H.

doi:10.1109/real.2004.9

Cited by 24 publications

(22 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [17], the authors have discussed an extension of time Petri nets adapted for scheduling. This extension is called scheduling extended time Petri nets (SETPN).…”

Section: Literature Reviewmentioning

confidence: 99%

“…In [17], time Petri nets are associated with two more properties and standing for resource allocation and priority, respectively. As an example, suppose two different concurrent tasks sharing the same resource ( is identical for both).…”

Section: Literature Reviewmentioning

confidence: 99%

“…The time Petri nets presented in [17] assign both priority and resources to places. It is particularly suitable for scheduling approaches.…”

Section: Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

Controller Synthesis of Time Petri Nets Using Stopwatch

Heidari

Boucheneb

2013

Journal of Engineering

View full text Add to dashboard Cite

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.

show abstract

“…In [17], the authors have discussed an extension of time Petri nets adapted for scheduling. This extension is called scheduling extended time Petri nets (SETPN).…”

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Controller Synthesis of Time Petri Nets Using Stopwatch

Heidari

Boucheneb

2013

Journal of Engineering

View full text Add to dashboard Cite

show abstract

“…In [23] and [24] extensions of TPN formalism are proposed in order to support the modelling of preemptive real-time systems. Bucci et al [23] introduce Preemptive Time Petri Nets (PTPNs) and a state space-based technique for their analysis.…”

Section: Related Workmentioning

confidence: 99%

“…Then, in the second stage, maximum execution times are computed for the critical traces by regenerating the actual set of state classes visited by the traces. Lime and Roux [24] define Scheduling Extended Time Petri Nets (SETPN) and propose an approximation method for computing the state space of a SETPN model as a stopwatch automaton. Stochastic TPN (sTPN) [25] is a suitable formalism for performance assessment of real-time system.…”

Section: Related Workmentioning

confidence: 99%

Computation of Performance Bounds for Real-Time Systems Using Time Petri Nets

Bernardi

Campos

2009

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Abstract-Time Petri Nets (TPNs) have been widely used for the verification and validation of real-time systems during the software development process. Their quantitative analysis consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem several methods have been proposed in the literature, that either provide rules to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. In this paper, we propose a method that consists in computing performance bounds to predict the average operational behavior of TPNs by exploiting their structural properties and by applying operational laws. Performance bound computation was first proposed for Timed (Timed PNs) and Stochastic Petri nets (SPNs). We generalize the results obtained for Timed PNs and SPNs to make the technique applicable to TPNs and their extended stochastic versions: TPN with firing frequency intervals (TPNFs) and Extended TPNs (XTPNs). Finally, we apply the proposed bounding techniques on the case study of a robotcontrol application taken from the literature.

show abstract