Verification of Timed-Arc Petri Nets

  • Lasse Jacobsen
  • Morten Jacobsen
  • Mikael H. Møller
  • Jiří Srba
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6543)
Cite this paper as:
Jacobsen L., Jacobsen M., Møller M.H., Srba J. (2011) Verification of Timed-Arc Petri Nets. In: Černá I. et al. (eds) SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011. Lecture Notes in Computer Science, vol 6543. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Lasse Jacobsen
    • 1
  • Morten Jacobsen
    • 1
  • Mikael H. Møller
    • 1
  • Jiří Srba
    • 1
  1. 1.Department of Computer ScienceAalborg UniversityAalborg EastDenmark

Personalised recommendations