Scribd
Upload
45 views

Discrete Event Systems Timed Models: Máté Hegyháti

The document discusses three topics related to timed models for discrete event systems: timed automata, timed Petri nets, and automata with time guards. Timed automata extend finite automata with clock variables to model the timing of events. Timed Petri nets add lifetime sequences to Petri nets to represent timing. Automata with time guards are finite state machines that include clock variables and constraints on transitions.

Uploaded by

Saaaaaaakkk
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

Discrete Event Systems Timed Models: Máté Hegyháti

The document discusses three topics related to timed models for discrete event systems: timed automata, timed Petri nets, and automata with time guards. Timed automata extend finite automata with clock variables to model the timing of events. Timed Petri nets add lifetime sequences to Petri nets to represent timing. Automata with time guards are finite state machines that include clock variables and constraints on transitions.

Uploaded by

Saaaaaaakkk
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Timed Automata

Timed Petri net

Automata with time guards

Discrete Event Systems Timed models


Mt Hegyhti
1

Department of Computer Science Faculity of Information Technology University of Pannonia

Last modied: April 20, 2009

[email protected] http://dcs.uni-pannon.hu/hegyhati/oktatas

Timed Automata

Timed Petri net

Automata with time guards

Contents

Timed Automata

Timed Petri net

Automata with time guards

Timed Automata

Timed Petri net

Automata with time guards

Timed automata
Timed automata:

where V  tv | P u is the clock structure or timing structure where v : Z R is a clock for event v pk q: the time needed for the activation of for the k th time The event sequence is not given, it is generated. The output is th event sequence 1 2 3 . . . with timing t1 , t2 t3 . . . .
1 ,t1

pK , , , s , Vq

q0

/ q1 2 ,t2 / q2 3 ,t3 / q3 4 ,t4 / q4 5 ,t5 / q5 6 ,t6 / q6

...

/ ...

Timed Automata

Timed Petri net

Automata with time guards

Dynamics
v : Z R is a clock for event y : Z R clock value for after the k th event N : Z Z score (number of activation attempts) of until the k th event Initialization: N p, 1q  y p, 1q  q0

# #

1 if P D ps q 0 otherwise v p1q if P D ps q 8 otherwise

s

Timed Automata

Timed Petri net

Automata with time guards

Dynamics
For all k

P Z k 2: k  arg minPD pq q y p, k 1q tk  tk 1 y pk , k 1q qk  pqk 1 , k q $ ' & N p, k 1q 1 if  k and P D pqk q N p, k 1q 1 if P D pq , k qzD pqk 1 q N p, k q  ' % N p, k 1q otherwise y p, 1q  $ ' v p, N p, k qq if  k and P D pqk q ' & v p, N p, k qq if P D pq , k qzD pqk 1 q ' y p, k 1q tk tk 1 if P D pq , k q X D pqk 1 q  k ' % 8 otherwise
k 1

Timed Automata

Timed Petri net

Automata with time guards

Timed Petri net

Timed Petri net: where V  tvt |t vt : Z R

P T u is the set of lifetime sequences:

pP , T , A, w , x0, Vq

Timed Automata

Timed Petri net

Automata with time guards

Clocks and constraints


Let C be a set of clocks. Clock constraints pC q: Words of language generated by the following CFG: V R

t, c , a, , , ^u tc , a, , , ^u | | |
ac c a ^

where c

P C and a P R

Timed Automata

Timed Petri net

Automata with time guards

Clock interpretations

P rC Rs

satises P pC q i evaluates to true using values given by . Notations

@ t P R , C 1 C t c pc q t # 1 rC t s x ptc q

if c P C 1 otherwise

Timed Automata

Timed Petri net

Automata with time guards

Automata with time guards


Automaton with time guards:

pK , , C , Tra, Inv , s q
where K set of states set of events C set of clocks Tra Inv

K pC q pC q K timed transitions : K pC q state invariants

s initial state

Timed Automata

Timed Petri net

Automata with time guards

State of a timed automaton, and transitions


The state of a timed automaton can be described by a pair: pq , q, where g

P K is the actual state : C R represents the time on clocks

The initial state of the timed automaton is ps , 0 q where 0 pc q  0 @c P C . State transitions: Delay transition Event transition

Timed Automata

Timed Petri net

Automata with time guards

Event transition
Delay transition Delay transition:

pq , q

/ q,

tq p0 t 1 t q .

Allowed if Inv pq q is satised for all t 1 Event transition

Let pq , , , C 1 , p q P Tra, then the event transition

pq , q

,,C 1

/ p, C 1

p r 0s q

is allowed if is satised for .

Timed Automata

Timed Petri net

Automata with time guards

Run or execution

Run of a timed automaton is a sequence of allowed delay- and event transitions: 1 1 1 q1 ,1 ,C/ 1pq1 , 1 q t2 / pq1 , 1 q2 ,2 ,C/2pq2 , 2 q ps , 0q t1 / ps , 0 1

t3

/ ...

The corresponding accepted timed word is:

pt1, 1q, pt1 t2, 2q, pt1 t2 t3, 3q, . . . ,

k
i 1


ti , k , . . .

Timed Automata

Timed Petri net

Automata with time guards

Parallel composition
Let M1

 pK1, 1, C1, Tra1, Inv1, s1q and M2  pK2, 2, C2, Tra2, Inv2, s2q
M1 ||M2

then

 pK1 K2, 1 Y 2, C1 Y C2, Tra1,2, Inv1,2, ps1, s2qq

where Inv1,2 pq1 , q2 q  Inv1 pq1 q ^ Inv2 pq2 q for all P 1 X 2 , if pqi , i , , Ci1 , pi q P Trai i  1, 2 then ppq1, q2q, 1 ^ 2, , C11 Y C21 , pp1, p2qq P Tra1,2 1 , p1 q P Tra1 then for all P 1 z2 , and q2 P K2 if pq1 , 1 , , C1 ppq1, q2q, 1, , C11 , pp1, q2qq P Tra1,2 1 , p2 q P Tra2 then for all P 2 z1 , and q1 P K1 if pq2 , 2 , , C2 1 ppq1, q2q, 2, , C2, pq1, p2qq P Tra1,2

You might also like