Verification of Timed-Arc Petri Nets (invited talk)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00054541" target="_blank" >RIV/00216224:14330/11:00054541 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-18381-2_4" target="_blank" >http://dx.doi.org/10.1007/978-3-642-18381-2_4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-18381-2_4" target="_blank" >10.1007/978-3-642-18381-2_4</a>
Alternative languages
Result language
angličtina
Original language name
Verification of Timed-Arc Petri Nets (invited talk)
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů