An Optimization Approach for Identification of Petri Nets


Abstract views: 25 / PDF downloads: 13

Authors

  • V. Padma Research scholar, Department of Mathematics, Mother Teresa Women’s University, Kodaikanal, India
  • K. Bhuvaneswari Head of Department, Department of Mathematics, Mother Teresa Women’s University, Kodaikanal, India

Keywords:

Petri Net, Optimization, Identification, Incidence matrix

Abstract

In this paper we deal with the problem of identifying a Petri net system, given a finite language that it generates .The set of transitions and the number of places is assumed to be known. Identification problem consists in determining a Petri net system starting from example/counter example of its language. Our optimization approach requires the constraints whose set of unknowns contains the elements of the pre and post incidence matrices and the initial marking of the net. We continue to discuss the linear programming techniques for the identification of Petri nets and study their properties.

 

Author Biographies

V. Padma, Research scholar, Department of Mathematics, Mother Teresa Women’s University, Kodaikanal, India

 

 

K. Bhuvaneswari, Head of Department, Department of Mathematics, Mother Teresa Women’s University, Kodaikanal, India

 

 

Downloads

Published

15-06-2016

How to Cite

V. Padma, & K. Bhuvaneswari. (2016). An Optimization Approach for Identification of Petri Nets. International Journal of Mathematics And Its Applications, 4(2 - D), 1–6. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1060

Issue

Vol. 4 No. 2 - D (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.