Computation Theory and Mathematics
Springer Nature - SN SciGraph project
10.1007/s10626-016-0225-6
doi
Marco
Pocci
Synchronizing sequences on a class of unbounded systems using synchronized Petri nets
85-108
2016-03
false
2016-03-01
https://scigraph.springernature.com/explorer/license/
en
research_article
http://link.springer.com/10.1007/s10626-016-0225-6
articles
2019-04-11T01:53
Determining the state of a system when one does not know its current initial state is a very important problem in many practical applications as checking communication protocols, part orienteers, digital circuit reset, etc. Synchronizing sequences have been proposed in the 60’s to solve the problem on systems modeled by finite state machines. This paper presents a first investigation of the synchronizing problem on unbounded systems, using synchronized Petri nets, i.e., nets whose evolution is driven by external input events. The proposed approach suffers from the fact that no finite space representation can exhaustively answer to the reachability problem but we show that synchronizing sequences may be computed for a particular class of unbounded synchronized Petri nets.
1573-7594
0924-6703
Discrete Event Dynamic Systems
DIEE, University of Cagliari, Cagliari, Italy
University of Cagliari
Aix Marseille Université, CNRS, ENSAM, Université de Toulon, LSIS UMR 7296, 13397, Marseille, France
Demongodin
Isabel
Norbert
Giambiasi
05f96d7b3789e28ec997701623d20aa4e4efbc5d7856781d110b6f553400f6b9
readcube_id
pub.1001254341
dimensions_id
Giua
Alessandro
Information and Computing Sciences
26
Aix Marseille Université, CNRS, ENSAM, Université de Toulon, LSIS UMR 7296, 13397, Marseille, France
Aix-Marseille University
1