Verification of Timed-Arc {P}etri Nets
| Authors | |
|---|---|
| Year of publication | 2011 |
| Type | Article in Proceedings |
| Conference | Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science ({SOFSEM}'11) |
| MU Faculty or unit | |
| Citation | |
| Web | http://www.springerlink.com/content/ek83j00501734324/ |
| Doi | http://dx.doi.org/10.1007/978-3-642-18381-2_4 |
| Field | Informatics |
| Keywords | verification; Petri net; tool; decidability |
| 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. |
| Related projects: |