Verification of Timed-Arc Petri Nets

Lasse Jacobsen, Morten Jacobsen, Mikael Harkjær Møller, Jiri Srba

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskning

28 Citationer (Scopus)

Resumé

Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with continuous time. Tokens in TAPN carry an age and arcs between places and transitions are labelled with time intervals restricting the age of tokens available for transition firing. The TAPN model posses a number of interesting theoretical properties distinguishing them from other time extensions of Petri nets. We shall give an overview of the recent theory developed in the verification of TAPN extended with features like read/transport arcs, timed inhibitor arcs and age invariants. We will examine in detail the boundaries of automatic verification and the connections between TAPN and the model of timed automata. Finally, we will mention the tool TAPAAL that supports modelling, simulation and verification of TAPN and discuss a small case study of alternating bit protocol.
OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Vol/bind6543
Sider (fra-til)46-72
Antal sider26
ISSN0302-9743
DOI
StatusUdgivet - 2011
Begivenhed37th Conference on Current Trends in Theory and Practice of Computer Science - Nový Smokovec, Slovakiet
Varighed: 22 jan. 201128 jan. 2011
Konferencens nummer: 37

Konference

Konference37th Conference on Current Trends in Theory and Practice of Computer Science
Nummer37
LandSlovakiet
ByNový Smokovec
Periode22/01/201128/01/2011

Fingerprint

Petri nets
Petri Nets
Arc of a curve
Automatic Verification
Timed Automata
Inhibitor
Modeling and Simulation
Continuous Time
Network protocols
Computer simulation
Interval
Invariant
Model

Citer dette

Jacobsen, Lasse ; Jacobsen, Morten ; Møller, Mikael Harkjær ; Srba, Jiri. / Verification of Timed-Arc Petri Nets. I: Lecture Notes in Computer Science. 2011 ; Bind 6543. s. 46-72.
@inproceedings{d30d61a9c12346bf98edd85326855914,
title = "Verification of Timed-Arc Petri Nets",
abstract = "Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with continuous time. Tokens in TAPN carry an age and arcs between places and transitions are labelled with time intervals restricting the age of tokens available for transition firing. The TAPN model posses a number of interesting theoretical properties distinguishing them from other time extensions of Petri nets. We shall give an overview of the recent theory developed in the verification of TAPN extended with features like read/transport arcs, timed inhibitor arcs and age invariants. We will examine in detail the boundaries of automatic verification and the connections between TAPN and the model of timed automata. Finally, we will mention the tool TAPAAL that supports modelling, simulation and verification of TAPN and discuss a small case study of alternating bit protocol.",
keywords = "Petri nets, timed analsysis, verification",
author = "Lasse Jacobsen and Morten Jacobsen and M{\o}ller, {Mikael Harkj{\ae}r} and Jiri Srba",
year = "2011",
doi = "10.1007/978-3-642-18381-2_4",
language = "English",
volume = "6543",
pages = "46--72",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Physica-Verlag",

}

Verification of Timed-Arc Petri Nets. / Jacobsen, Lasse; Jacobsen, Morten; Møller, Mikael Harkjær; Srba, Jiri.

I: Lecture Notes in Computer Science, Bind 6543, 2011, s. 46-72.

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskning

TY - GEN

T1 - Verification of Timed-Arc Petri Nets

AU - Jacobsen, Lasse

AU - Jacobsen, Morten

AU - Møller, Mikael Harkjær

AU - Srba, Jiri

PY - 2011

Y1 - 2011

N2 - Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with continuous time. Tokens in TAPN carry an age and arcs between places and transitions are labelled with time intervals restricting the age of tokens available for transition firing. The TAPN model posses a number of interesting theoretical properties distinguishing them from other time extensions of Petri nets. We shall give an overview of the recent theory developed in the verification of TAPN extended with features like read/transport arcs, timed inhibitor arcs and age invariants. We will examine in detail the boundaries of automatic verification and the connections between TAPN and the model of timed automata. Finally, we will mention the tool TAPAAL that supports modelling, simulation and verification of TAPN and discuss a small case study of alternating bit protocol.

AB - Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with continuous time. Tokens in TAPN carry an age and arcs between places and transitions are labelled with time intervals restricting the age of tokens available for transition firing. The TAPN model posses a number of interesting theoretical properties distinguishing them from other time extensions of Petri nets. We shall give an overview of the recent theory developed in the verification of TAPN extended with features like read/transport arcs, timed inhibitor arcs and age invariants. We will examine in detail the boundaries of automatic verification and the connections between TAPN and the model of timed automata. Finally, we will mention the tool TAPAAL that supports modelling, simulation and verification of TAPN and discuss a small case study of alternating bit protocol.

KW - Petri nets, timed analsysis, verification

U2 - 10.1007/978-3-642-18381-2_4

DO - 10.1007/978-3-642-18381-2_4

M3 - Conference article in Journal

VL - 6543

SP - 46

EP - 72

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -