Modular Reachability Analysis for Time Petri Nets with Guarded Transitions

Abstract

This paper proposes a modular algorithm for reachability analysis of timed DES models based on a Time Petri Net with guarded transitions. For large systems with a “high level of concurrency” the state space explosion leads unavoidably to computational problems. We propose to compute the “local subtraces” (connecting one input place to one output place within one single state machine), and then to select those traces that satisfy the additional constraints imposed by the synchronizing transitions after the output places. Moreover we allow for some transitions in a state machine to be guard dependent such that they can be executed only if some logical propositions (logical guard) defined over the marking of other state machines are true.