A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
| Authors | |
|---|---|
| Year of publication | 2012 |
| Type | Article in Periodical |
| Magazine / Source | Electronic Proceedings of Theoretical Computer Science |
| MU Faculty or unit | |
| Citation | |
| Web | Web |
| Doi | http://dx.doi.org/10.4204/EPTCS.102.12 |
| Field | Informatics |
| Keywords | Petri nets; verification; timed systems; reachability |
| Description | Timed-arc Petri nets (TAPN) are a well-known time extension of thePetri net model and several translations to networks of timedautomata have been proposed for this model.We present a direct, DBM-basedalgorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants.We also give a complete proof of its correctness,including reduction techniques based on symmetries and extrapolation.Finally, we augment the algorithm with a novel state-spacereduction technique introducing a monotonic ordering on markings and prove its soundness even in the presence of monotonicity-breaking features like age invariants and inhibitor arcs. We implement the algorithm within the model-checkerTAPAAL and the experimental results document an encouraging performance compared to verification approaches that translate TAPN models to UPPAAL timed automata. |
| Related projects: |