A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Fault Detection and Diagnosis in Distributed Systems: An Approach by Partially Stochastic Petri Nets
Discrete Event Dynamic Systems
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Liveness verification of discrete event systems modeled by n-safe ordinary Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Trellis Processes: A Compact Representation for Runs of Concurrent Systems
Discrete Event Dynamic Systems
Reduction of constraints for controller synthesis based on safe Petri Nets
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
In this paper we deal with the problem of controlling a safe place/transition net so as to avoid a set of forbidden markings $${\user1{\mathcal{F}}}$$. We say that a given set of markings has property REACH if it is closed under the reachability operator. We assume that all transitions of the net are controllable and that the set of forbidden markings $${\user1{\mathcal{F}}}$$ has the property REACH.The technique of unfolding is used to design a maximally permissive supervisor to solve this control problem. The supervisor takes the form of a set of control places to be added to the unfolding of the original net.The approach is also extended to the problem of preventing a larger set $${\user1{\mathcal{F}}}_{I}$$ of impending forbidden marking. This is a superset of the forbidden markings that also includes all those markings from which--unless the supervisor blocks the plant--a marking in $${\user1{\mathcal{F}}}$$ is inevitably reached in a finite number of steps.Finally, we consider the particular case in which the control objective is that of designing a maximally permissive supervisor for deadlock avoidance and we show that in this particular case our procedure can be efficiently implemented by means of linear algebraic techniques.