Paper Info
Title
On the reachability and reversibility problems in a class of Petri nets
Abstract
The paper faces the reachability and the reversibility problems in a class of Petri nets larger than other classes investigated for the same problems. The considered class of Petri net represents a formal language to design and analyze logic controllers. These nets may be decomposed in simple structures, called elementary control tasks, linked together through a limited number of connections, giving rise to arbitrarily complex nets. Such connections are the ones encountered in a typical logic control problem, as exchange of enabling signals (consensus/deny to control maneuvers) and the synchronous execution (shared resources modeling or shared operations). The purpose of the paper is to enlarge the set of theoretical tools previously developed for the incremental approach to the liveness analysis of a net, to be incorporated into a special CAD environment. In particular, the addressed topics are the choice of the initial marking and the analysis of reachability of non live markings.
Year
DOI
Venue
1994
10.1109/21.310530
IEEE Transactions on Systems, Man, and Cybernetics
Keywords
DocType
Volume
Petri nets,control system CAD,control system analysis,control system synthesis,controllability,formal languages,CAD environment,Petri nets,decomposition,elementary control tasks,enabling signals exchange,logic control,net liveness analysis,reachability,reversibility,shared operations,shared resources modeling,synchronous execution
Journal
24
Issue
ISSN
Citations 
10
0018-9472
6
PageRank 
References 
Authors
0.55
4
1
Name
Order
Citations
PageRank
L. Ferrarini117419.00