Modeling flexible real time systems with preemptive time Petri nets

Preemptive Time Petri nets are obtained by extending Time Petri nets with an additional mechanism of resource assignment which makes the progress of timed transitions be dependent on the availability of a set of preemptable resources, and with the capability to make transition times and priorities b...

Full description

Saved in:
Bibliographic Details
Published in15th Euromicro Conference on Real-Time Systems, 2003. Proceedings pp. 279 - 286
Main Authors Bucci, G., Fedeli, A., Sassoli, L., Vicario, E.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Availability
Degradation
Dynamic scheduling
Petri nets
Power system modeling
Processor scheduling
Real time systems
Runtime
Safety
State-space methods
Online AccessGet full text

Cover

More Information
Summary:Preemptive Time Petri nets are obtained by extending Time Petri nets with an additional mechanism of resource assignment which makes the progress of timed transitions be dependent on the availability of a set of preemptable resources, and with the capability to make transition times and priorities be dependent on the marking. The combination of these capabilities supports description and verification of flexible real time systems running under preemptive scheduling, with periodic, sporadic and one shot processes, with non-deterministic execution times, with semaphore synchronizations and precedence relations deriving from internal task sequentialization and from interprocess communication. The expressive capabilities of the model and the type of results that can be derived through symbolic enumeration of its dense-timed state space are illustrated with reference to a flexible system mixing dynamic acceptance and performance polymorphism.
ISBN:0769519369
9780769519364
DOI:10.1109/EMRTS.2003.1212753