Real time identification of discrete event systems using Petri nets

Automatica

Volumn 44, Issue 5, 2008, Pages 1209-1219

  Dotoli, Mariagrazia ^a   Fanti, Maria Pia ^a   Mangini, Agostino Marcello ^a  

^a POLITECNICO DI BARI   (Italy)

Author keywords

Discrete event systems; Identification algorithms; Integer programming; Petri nets

Indexed keywords

IDENTIFICATION (CONTROL SYSTEMS); INTEGER PROGRAMMING; LINEAR PROGRAMMING; PETRI NETS; REAL TIME SYSTEMS;

IDENTIFICATION ALGORITHMS; REAL TIME IDENTIFICATION;

DISCRETE EVENT SIMULATION;

EID: 41949092080     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2007.10.014     Document Type: Article

References (23)

1. Angluin D. Introductive inference of formal languages from positive data. Information and Control 45 (1980) 117-135
2. Angluin D. Learning regular sets from queries and counterexamples. Information and Computation 75 (1987) 87-106
3. Badouel E., Berardinello L., and Darondeau P. The synthesis problem for elementary net systems is NP-complete. Theorical Computer Science 186 (1997) 107-134
4. Badouel E., and Darondeau P. Theory of regions. Lectures on Petri nets I: Basic models. Lecture notes in computer science Vol. 1491 (1998), Springer 529-586
5. Basile F., Chiacchio P., and Giua A. Suboptimal supervisory control of Petri nets in presence of uncontrollable transitions via monitor places. Automatica 42 6 (2006) 995-1004
6. Bourdeaud'Huy, T., & Yim, P. (2004). Synthése de réseaux de Petri á partir d'exigences. In Proc. 5th French conference on modeling and simulation
7. Cabasino, M. P., Giua, A., & Seatzu, C. (2006). Identification of deterministic Petri nets. In Proc. 8th international workshop on discrete event systems (pp. 325-331)
8. Cassandras C.G., and Lafortune S. An introduction to discrete event systems (1999), Kluwer Academic Publisher, Boston, MA
9. Chung, S. L., Li, C. L., Wu, J. C., & Wang, S. T. (2003). Online modeling refinement for discrete event systems. In Proc. IEEE conf. on systems, man and cybernetics: Vol. 3 (pp. 2739-2744)
10. Cortadella J., Kishinevsky M., Lavagno L., and Yakovlev A. Deriving Petri nets from finite transition systems. IEEE Transactions on Computers 47 8 (1998) 859-882
11. m. Journal of Computer and System Sciences 59 (1999) 373-391
12. Giua A., Corona D., and Seatzu C. State estimation of λ-free labeled Petri nets with contact-free nondeterministic transitions. Journal of Discrete Event Dynamic Systems 15 1 (2005) 85-108
13. Giua, A., & Seatzu, C. (2005). Identification of free-labeled Petri nets via integer programming. In Proc. 44th IEEE conf. on decision and control (pp. 7639-7644)
14. http://www.gnu.org/software/glpk/glpk.html. Gnu Linear Programming Kit
15. Gold E.M. Language identification in the limit. Information and Control 10 (1967) 447-474
16. Gold E.M. Complexity of automaton identification from given data. Information and Control 37 (1980) 117-135
17. Hillier F.S., and Lieberman G.J. Introduction to operations research (2005), Mc Graw Hill, New York, NY, USA
18. Hiraishi K. Construction of a class of safe Petri nets by presenting firing sequences. In: K., and Jensen (Eds). Lecture notes in computer science Vol. 616 (1992), Springer-Verlag 244-262
19. Hiraishi K. Synthesis of supervisor for discrete event systems allowing concurrent behaviour. IEEE proceedings Vol. 5 (1999) 13-20
20. Meda-Campaña, M. E., & López-Mellado, E. (2005). Identification of concurrent discrete event systems using Petri nets. In Proc. of IMACS world congress (pp. 11-15)
21. Nelles O. Nonlinear system identification (2001), Springer-Verlag, Berlin, Heidelberg, Germany
22. Peterson J.L. Petri net theory and the modeling of systems (1981), Prentice Hall, Englewood Cliffs, NJ, USA
23. Sreenivas R.S. On minimal representations of Petri net languages. IEEE Transactions on Automatic Control 51 5 (2006) 799-804