From multimedia models to multimedia transport protocols

Diaz, Michel; Owezarski, Philippe

doi:10.1016/s0169-7552(97)00071-8

Cited by 10 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…and [a 4 , b 4 ] = [3,11] . Let us consider the following simulation for k = 0, 1 and 2. k 0 1 2 x 1 4 11 11 x 2 0 7 14 x 3 0 6 13 The first table contains the firing dates while each column k of the second table is the bounds of the sojourn time (in absolute time) of the tokens, produced by the k th firing of the transitions x 1 , x 2 and x 3 in each place.…”

Section: (Max +) Model Of P-time Event Graphsmentioning

confidence: 99%

From Extremal Trajectories to Token Deaths in P-time Event Graphs

Declerck

2011

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

Abstract-In this paper, we consider the (max, +) model of P-time Event Graphs whose behaviors are defined by lower and upper bound constraints. The extremal trajectories of the system starting from an initial interval are characterized with a particular series of matrices for a given finite horizon. Two dual polynomial algorithms are proposed to check the existence of feasible trajectories. The series of matrices are used in the determination of the maximal horizon of consistency and the calculation of the date of the first token deaths.

show abstract

Section: (Max +) Model Of P-time Event Graphsmentioning

confidence: 99%

From Extremal Trajectories to Token Deaths in P-time Event Graphs

Declerck

2011

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

show abstract

“…Time Stream PNs are an extension of Petri nets which allows to represent complex synchronizations and temporal compositions of the tasks or processes which are carried out (Courtiat et al, 1996) (Diaz and Owezarski, 1997 …”

Section: Modelling Of Time Stream Event Graphsmentioning

confidence: 99%

“…Among these PNs, we can quote P-time Petri nets (P-time PNs), Time stream Petri nets (Time Stream PNs),.... which extend the application field of Timed Event Graphs. Time Stream Event Graphs for example, allow to specify the synchronization requirements of multimedia applications (Diaz and Owezarski, 1997) and can describe complex synchronizations. The Time Stream Petri Nets present different types of semantic as "And", "Weak-And", "Strong-Or", "Or", "Master" and theirs variations (Courtiat et al, 1996) which correspond to different temporal evolutions.…”

Section: Introductionmentioning

confidence: 99%