TAPAAL is a tool for modelling, simulation and verification of Timed-Arc Petri nets developed at Department of Computer Science at Aalborg University in Denmark and it is available for Linux, Windows and Mac OS X platforms.[1]
| Developer(s) | Aalborg University |
|---|---|
| Initial release | 2008 |
| Stable release | 3.9.4
/ January 24, 2023 |
| Written in | C++ and GUI in Java |
| Operating system | Linux Mac OS X Microsoft Windows |
| Available in | English |
| Type | Model checking |
| License | Open source |
| Website | http://www.tapaal.net |
Timed-Arc Petri Net (TAPN) is a time extension of the classical Petri net model (a commonly used graphical model of distributed computations introduced by Carl Adam Petri in his dissertation in 1962). The time extension considered in TAPN allows for explicit treatment of real-time, which is associated with the tokens in the net (each tokens has its own age) and arcs from places to transitions are labelled by time intervals that restrict the age of tokens that can be used in order to fire the respective transition. In TAPAAL tool a further extension of this model with age invariants with transport arcs (which are more expressive than for example previously considered read-arcs) and with inhibitor arcs is implemented.
The TAPAAL tool offers a graphical editor for drawing TAPN models, simulator for experimenting with the designed nets and a verification environment that automatically answers logical queries formulated in a subset of CTL logic (essentially EF, EG, AF, AG formulae without nesting). It also allows the user to check whether a given net is k-bounded for a given number k. TAPAAL is equipped with its own verification engines distributed together with TAPAAL (one for continuous time[2] and one for discrete time[3] ). Optionally, the user can automatically translate TAPAAL models into UPPAAL and rely on the UPPAAL verification engine.
External links
edit- TAPAAL website, download
- DES unit, Deptment of Computer Science, Aalborg University, Denmark
- TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets by J. Byg, K.Y. Jørgensen and J. Srba, ATVA'09, Springer
- An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata by J. Byg, K.Y. Jørgensen and J. Srba, ICFEM'09, Springer
- A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking by L. Jacobsen, M. Jacobsen, M.H. Møller and J. Srba, EPEW'10, Springer
- Verification of Timed-Arc Petri Nets by L. Jacobsen, M. Jacobsen, M.H. Møller and J. Srba, SOFSEM'11, Springer
References
edit- ^ Alexandre David; Lasse Jacobsen; Morten Jacobsen; Kenneth Yrke Jørgensen; Mikael H. Møller; Jiří Srba (2012). "TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets". Tools and Algorithms for the Construction and Analysis of Systems. LNCS. Vol. 7214. pp. 492–497. doi:10.1007/978-3-642-28756-5_36. ISBN 978-3-642-28755-8.
- ^ Alexandre David; Lasse Jacobsen; Morten Jacobsen; Jiří Srba (2012). "A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets". Electronic Proceedings in Theoretical Computer Science. 102: 141–155. arXiv:1211.6194. doi:10.4204/EPTCS.102.12. S2CID 15499812.
- ^ M. AndersenH.G. LarsenJ. SrbaM.G. SørensenJ.H. Taankvist (2012). "Verification of Liveness Properties on Closed Timed-Arc Petri Nets". Mathematical and Engineering Methods in Computer Science. LNCS. Vol. 7721. pp. 69–81. doi:10.1007/978-3-642-36046-6_8. ISBN 978-3-642-36044-2.
 | This formal methods-related article is a stub. You can help Wikipedia by expanding it. |