## Synchronizing Sequences On Not Strongly Connected Petri Nets

### Marco Pocci, Isabel Demongodin, Norbert Giambiasi and Alessandro Giua

**Symposium On Theory of Modeling and Simulation - DEVS Integrative M&S Symposium (TMS/DEVS 2011)**
Boston, MA, USA, April 4-9, 2011

## Summary

In testing Discrete Event System, an important topic is determining the final state of the machine after the application of a test. Synchronizing and Homing sequences have been proposed in the sixties to solve the problem using Mealy machine. In the synchronizing sequences problem we want to drive an implementation of a given model, seen as a black box, to a known state regardless of its initial state and the outputs. In this paper, we investigate how to determine synchronizing sequences using systems represented by a class of synchronized Petri nets. We propose an approach such that even for not strongly connected -but still connected- net, regardless of the number of tokens that the net contains, a synchronizing sequence may be computed in terms of the net structure, thus avoiding the state explosion problem.

START
Conference Manager (V2.56.8 - Rev. 1568)