Scribd
Upload
26 views11 pages

Modeling and Verification of Concurrent Systems: Time Petri Nets

The document introduces Time Petri Nets (TPNs) which extend Petri nets with time constraints on transitions. TPNs have both discrete transitions between markings and continuous timed transitions where token times evolve. The symbolic state space aggregates equivalent states to finitely represent the generally infinite state space induced by timing constraints. Symbolic simulation combines discrete moves with zones of clock valuations to capture behaviors constrained by timing. Human: Thank you for the summary. You captured the key points about TPNs, their semantics, and how symbolic state spaces are used to represent them concisely. Nice work!

Uploaded by

anonymeeee
Copyright
© © All Rights Reserved
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
26 views11 pages

Modeling and Verification of Concurrent Systems: Time Petri Nets

The document introduces Time Petri Nets (TPNs) which extend Petri nets with time constraints on transitions. TPNs have both discrete transitions between markings and continuous timed transitions where token times evolve. The symbolic state space aggregates equivalent states to finitely represent the generally infinite state space induced by timing constraints. Symbolic simulation combines discrete moves with zones of clock valuations to capture behaviors constrained by timing. Human: Thank you for the summary. You captured the key points about TPNs, their semantics, and how symbolic state spaces are used to represent them concisely. Nice work!

Uploaded by

anonymeeee
Copyright
© © All Rights Reserved
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/ 11

Introduction

TPN definition
Symbolic state space
Timed CTL

Modeling and Verification of Concurrent Systems:


Time Petri Nets

Claude JARD

University of Nantes

November, 2019

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Timed Petri Nets (TPNs)


Time constraints are put on the transitions ([0,∞[ if none)

p1 p3

[0, 4]t1 t3 [5, 6]

p2

t2 [3, 4]

State: marking + transition timers


τ (4) 1 t
(p1 p3 , t1 = 0, t3 = 0) → (p1 p3 , t1 = 4, t3 = 4) → (p2 p3 , t2 =
τ (1) 3 t
0, t3 = 4) → (p2 p3 , t2 = 1, t3 = 5) → ...
Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N
Introduction
TPN definition
Symbolic state space
Timed CTL

Priorities

p1 t3 [3, 3]

[1, 2]t1

p2

t2 [3, 4]

t3 is dead...

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Continuously enabled

p1 t2 [3, 3]

[2, 2]t1

t1 is dead...

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Syntax

A Time Petri Net N is a tuple (P, T , W , M0 , I )


I : T → N × (N ∪ {∞}), notation: [I (t)− , I (t)+ ]
State: (M, ν) where ν : en(M) → R+

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Semantics

Defined by a transition system:


a
Discrete transition: (M, ν) → (M 0 , ν 0 ) iff ∃t = (a, I (t)) such
that:
t ∈ en(t), M 0 = M − •t + t •
ν(t) ∈ I (t)
ν 0 (t 0 ) = 0 if t 0 ∈ en(M 0 ) \ en(M), ν(t 0 ) otherwise
δ
Timed transition: (M, ν) → (M 0 , ν 0 ) iff
M = M 0 and ν 0 = ν + δ
∀t ∈ en(M), ∀δ 0 ≤ δ, ν(t) + δ 0 ≤ I (t)+

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Symbolic state space

The state space is generally infinite (even if the underlying


Petri net is bounded)
Idea: group equivalent states to capture the discrete behaviors
Finite characterization of the continuous behaviors is
impossible

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Symbolic simulation
p1 p2

[0, ∞]t1 t2 [1, 1] t3 [1, 1]

p3

δ
Infinite branching: ∀δ ∈ [0, 1], (p1 p2 , ν(t1 ) = 0, ν(t2 ) = 0) →
(p1 p2 , ν(t1 ) = δ, ν(t2 ) = δ)
τ
Symbolic: (p1 p2 , t1 = t2 = 0) → (p1 p2 , t1 = t2 ∈ [0, 1])
Graph of zones: aggregates the symbolic timed transition with
the discrete move
Able to finitely represent all the discrete behaviors constrained
by the timing constraints (this graph is generally larger than
the marking graph of the underlying untimed Petri net (if
bounded)). Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N
Introduction
TPN definition
Symbolic state space
Timed CTL

Symbolic simulation

p1 p2

[0, ∞]t1 t0 [1, 2] t2 [1, 2]

p3 p4

t3 [3, 3]

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Example: marking graph

C0

T1 T2

C1 C2 T0

T3 T2 T1

C4 C3

T2 T3

C5

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N


Introduction
TPN definition
Symbolic state space
Timed CTL

Example: symbolic marking graph

C0

T1 T2

C1 C2 T0

T2 T1

C3

T3

C4

Claude JARD Modeling and Verification of Concurrent Systems: Time Petri N

You might also like