Verification of Timed-Arc Petri Nets

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

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskning

31 Citationer (Scopus)

Abstrakt

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

Fingeraftryk Dyk ned i forskningsemnerne om 'Verification of Timed-Arc Petri Nets'. Sammen danner de et unikt fingeraftryk.

Citationsformater