Learning regular sets from queries and counterexamples
Information and Computation
The synthesis problem for elementary net systems is NP-complete
Theoretical Computer Science
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
Petri net languages and infinite subsets of Nm
Journal of Computer and System Sciences
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Construction of a Class of Safe Petri Nets by Presenting Firing Sequences
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
State Estimation of λ-free Labeled Petri Nets with Contact-Free Nondeterministic Transitions*
Discrete Event Dynamic Systems
Automatica (Journal of IFAC)
Improving real-time identification of Petri nets using timing information
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
The identification of discrete-event dynamic systems based on the evolutionary programming
International Journal of Knowledge-based and Intelligent Engineering Systems
| Hi-index | 22.15 |
The paper defines the identification problem for Discrete Event Systems (DES) as the problem of inferring a Petri Net (PN) model using the observation of the events and the available output vectors, that correspond to the markings of the measurable places. Two cases are studied considering different levels of the system knowledge. In the first case the place and transition sets are assumed known. Hence, an integer linear programming problem is defined in order to determine a PN modelling the DES. In the second case the transition and place sets are assumed unknown and only an upper bound of the number of places is given. Hence, the identification problem is solved by an identification algorithm that observes in real time the occurred events and the corresponding output vectors. The integer linear programming problem is defined at each observation so that the PN can be recursively identified. Some results and examples characterize the identified PN systems and show the flexibility and simplicity of the proposed technique. Moreover, an application to the synthesis of supervisory control of PN systems via monitor places is proposed.