Verification of Timed-Arc Petri Nets

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

doi:10.1007/978-3-642-18381-2_4

Verification of Timed-Arc Petri Nets

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

Institut for Datalogi

Publikation: Bidrag til tidsskrift › Konferenceartikel i tidsskrift › Forskning

36 Citationer (Scopus)

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.

Originalsprog	Engelsk
Bogserie	Lecture Notes in Computer Science
Vol/bind	6543
Sider (fra-til)	46-72
Antal sider	26
ISSN	0302-9743
DOI	https://doi.org/10.1007/978-3-642-18381-2_4
Status	Udgivet - 2011
Begivenhed	37th Conference on Current Trends in Theory and Practice of Computer Science - Nový Smokovec, Slovakiet Varighed: 22 jan. 2011 → 28 jan. 2011 Konferencens nummer: 37

Konference

Konference	37th Conference on Current Trends in Theory and Practice of Computer Science
Nummer	37
Land/Område	Slovakiet
By	Nový Smokovec
Periode	22/01/2011 → 28/01/2011

Adgang til dokumentet

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

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Citationsformater

@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",

note = "37th Conference on Current Trends in Theory and Practice of Computer Science ; Conference date: 22-01-2011 Through 28-01-2011",

}

TY - GEN

T1 - Verification of Timed-Arc Petri Nets

AU - Jacobsen, Lasse

AU - Jacobsen, Morten

AU - Møller, Mikael Harkjær

AU - Srba, Jiri

N1 - Conference code: 37

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

SN - 0302-9743

VL - 6543

SP - 46

EP - 72

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 37th Conference on Current Trends in Theory and Practice of Computer Science

Y2 - 22 January 2011 through 28 January 2011

ER -

Verification of Timed-Arc Petri Nets

Abstract

Konference

Adgang til dokumentet

AUB Link

Fingeraftryk

Citationsformater