By Topic

Testing Experiments on Synchronized Petri Nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Pocci, M. ; Lab. des Sci. de l'Inf. et des Syst., Aix-Marseille Univ., Marseille, France ; Demongodin, I. ; Giambiasi, N. ; Giua, A.

Synchronizing sequences have been proposed in the late 1960s to solve testing problems on systems modeled by finite-state machines. Such sequences lead a system, seen as a black box, from an unknown current state to a known final one. This paper presents a first investigation of the computation of synchronizing sequences for systems modeled by synchronized Petri nets. In the first part of the paper, existing techniques for automata are adapted to this new setting. Later on, new approaches, that exploit the net structure to efficiently compute synchronizing sequences without an exhaustive enumeration of the state space, are presented.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:11 ,  Issue: 1 )