Synchronizing sequences on not strongly connected Petri nets (Work-in-Progress)

Authors:
Marco Pocci;Isabel Demongodin;Norbert Giambiasi;Alessandro Giua
Affiliations:
Laboratoire des Sciences de l'Information et des Systémes, Campus de Saint Jérôme, Marseille, France;Laboratoire des Sciences de l'Information et des Systémes, Campus de Saint Jérôme, Marseille, France;Laboratoire des Sciences de l'Information et des Systémes, Campus de Saint Jérôme, Marseille, France;University of Cagliari, Cagliari, Italy
Venue:
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Year:
2011

Citing 10
Cited 0

Reset sequences for monotonic automata

SIAM Journal on Computing
Minimum length synchronizing sequences of finite state machine

DAC '93 Proceedings of the 30th international Design Automation Conference
Design and validation of protocols: a tutorial

Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
Protocol testing: review of methods and relevance for software testing

ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Application of Homing Sequences to Synchronous Sequential Circuit Testing

IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines

IEEE Transactions on Software Engineering
An algorithmic approach to the automated design of parts orienters

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Model Driven Testing Based on Test History

Transactions on Petri Nets and Other Models of Concurrency I
Discrete, Continuous, and Hybrid Petri Nets

Discrete, Continuous, and Hybrid Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 machines. A synchronizing sequence drives 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 that can be applied to (not necessarily strongly) connected nets. 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.