Dynamic Slicing of Time Petri Net Based on MTL Property

Abstract

The time Petri net (TPN) is a powerful tool for modeling, simulating, and verifying real-time systems. Unfortunately, the state spaces of the time Petri net grow exponentially due to the complexity of real-time systems. The enormous size of the state spaces could also cause state explosion problems in model checking. This paper proposes an alternative dynamic slicing algorithm written as a metric temporal logic (MTL) formula to reduce the size of the time Petri net model by considering specific criteria. Our algorithm proposes an alternative dependency graph representing the global firing time interval of the transition to remove the transitions that are never fired and do not affect the state space. The dynamic slicing algorithm involves the initial marking and the properties of the target metric temporal logic formula. Unlike the unsliced time Petri net, the result preserves all necessary execution paths for the model checking of a particular metric temporal logic formula. Therefore, model checking can generate sufficient state space to conduct verification equivalent to the unsliced time Petri net but may take less time, including if the unsliced time Petri net causes state space explosion.