Timed Petri Nets: Probabilistic Selection Of Data Dependent Paths

Abstract

In this paper, the probabilistic selection of data dependent paths, in a time-augmented Petri net model, is introduced and tackled. Real-time systems are classified according to their timing requirements into soft real-time systems and hard real-time systems. It is shown that the type of real-time system to be modeled greatly effects the timing considerations that ensure proper performance. Expressions for the conditions needed to guarantee a correct functioning are derived. Some illustrative case studies are presented.

Keywords:

• Data dependent paths
• hard real-time system
• probabilistic Petri nets
• soft real-time system

C.R. Categories:

• C.4
• D.2.8

^∗Assistant Professor

dagger;On leave at: Department of Computer Science, 3190 MEB, University of Utah, SLC, UT 84112

^∗Assistant Professor

dagger;On leave at: Department of Computer Science, 3190 MEB, University of Utah, SLC, UT 84112

Notes

^∗Assistant Professor

dagger;On leave at: Department of Computer Science, 3190 MEB, University of Utah, SLC, UT 84112