A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets


Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We present a direct, DBM-based algorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants. We also give a complete proof… (More)
DOI: 10.4204/EPTCS.102.12


4 Figures and Tables