Model Identification and Synthesis of Discrete-Event Systems

Contemporary Issues in Systems Science and Engineering

Volumn , Issue , 2015, Pages 343-366

  Cabasino, Maria Paola ^a   Darondeau, Philippe ^b   Fanti, Maria Pia ^c   Seatzu, Carla ^a  

^a UNIVERSITY OF CAGLIARI   (Italy)

^b INRIA   (France)

^c POLITECNICO DI BARI   (Italy)

Author keywords

Behavioral descriptions; Discrete event system framework; Linear integer programming; Synthesis problem; Synthesized net

Indexed keywords

INTEGER PROGRAMMING;

BEHAVIORAL DESCRIPTIONS; LABELING FUNCTIONS; LINEAR INTEGER PROGRAMMING; MODEL IDENTIFICATION; SIMPLIFYING ASSUMPTIONS; SYNTHESIS PROBLEMS; SYNTHESIZED NET; TRANSITION SYSTEM;

DISCRETE EVENT SIMULATION;

EID: 85016475721     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9781119036821.ch10     Document Type: Chapter

References (62)

1. O. Nelles. Nonlinear System Identification, Berlin Heidelberg, Germany: Springer, 2001.
2. A. P. Estrada-Vargas, E. Lòpez-Mellado, and J.-J. Lesage. A comparative analysis of recent identification approaches for discrete-event systems. Mathematical Problems in Engineering, vol. 2010, Article ID 453254, 21 pages, 2010. doi:10.1155/2010/453254.
3. J. Esparza, M. Leucker, and M. Schlund. Learning workflow Petri nets. Applications and Theory of Petri nets, Lecture Notes in Computer Science, 6128: 206-225, 2010. doi:10.1016/j.conengprac.2010.12.010.
4. M. Gold. Language identification in the limit. Information and Control, 10: 447-474, 1967.
5. S. Jein and E. Kinber. Learning languages from positive data and a finite number of queries. Information and Control, 204: 123-175, 2006.
6. J. Case and C. Lynes. Machine inductive inference and language identification. Lecture Notes in Computer Science, 140: 107-115, 1982.
7. D. Osherson and S. Weinstein. Criteria of language learning. information and control. Information and Control, 52: 123-138, 1982.
8. G. Baliga, J. Case, and S. Jain. Language learning with some negative information. Journal of Computer and System Sciences, 51(5): 273-285, 1995.
9. D. Angulin. Inductive inference of formal languages from positive data. Information and Control, 45: 117-135, 1980.
10. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37(3): 302-320, 1978.
11. D. Angluin. Queries and concept learning. Machine Learning, 2: 319-342, 1988.
12. T. L. Booth. Sequential Machines and Automata Theory, New York: John Wiley & Sons, 1967.
13. J. Kella. Sequential machine identification. IEEE Transactions on Computers, 20(3): 332-338, 1971.
14. A. W. Biermann and J. A. Feldman. On the synthesis of finite-state machines from samples of their behavior. IEEE Transactions on Computers, 21(6): 592-597, 1972.
15. A. Nerode. Linear automaton transformations. Proceeding of Americal Mathematical Society, 9: 541-544, 1958.
16. L. P. J. Veelenturf. Inference of sequential machines from sample computations. IEEE Transactions on Computers, 27(2): 167-170, 1978.
17. L. P. J. Veelenturf. An automata-theoretical approach to developing learning neural networks. Cybernetics and Systems, 12(1-2): 179-202, 1981.
18. M. Richetin, M. Naranjo, and P. Luneau. Identification of automata by sequential learning. Pattern Recognition Letters, 2(6): 379-385, 1984.
19. C.-C. Ku and K. Y. Lee. Diagonal recurrent neural networks for dynamic systems control. IEEE Transactions on Neural Networks, 6(1): 144-156, 1995.
20. S. Das and R. Das. Induction of discrete state-machine by stabilizing a continuous recurrent network using clustering. Computer Science and Informatics, 21(2): 35-40, 1991.
21. S. Das and M. Mozer. Dynamic on-line clustering and state extraction: an approach to symbolic learning. Neural Networks, 11(1): 53-64, 1998.
22. Z. Zeng, R. M. Goodman, and P. Smythe. Learning finite state machines with self-clustering recurrent neural networks. Neural Computation, 5(6): 976-990, 1993.
23. I. Gabrijel and A. Dobnikar. On-line identification and reconstruction of finite automata with generalized recurrent neural networks. Neural Networks, 16(1): 101-120, 2003.
24. S. H. Won, I. Song, S. Y. Lee, and C. H. Park. Identification of finite state automata with a class of recurrent neural networks. IEEE Transactions on Neural Networks, 21(9): 1408-1421, 2010.
25. V. B. Kudryavtsev, I. S. Grunskii, and V. A. Kozlovskii. Analysis and synthesis of abstract automata. Journal of Mathematical Sciences, 169(4): 481-532, 2010.
26. D. Lee and M. Yannakakis. Principles and methods of testing finite state machines-a survey. Proceedings of IEEE, 48(8): 1090-1123, 1996.
27. A. Ehrenfeucht and G. Rozenberg. Partial (Set) 2-Structures-Part 1 and Part 2. Acta Informatica, 27(4): 315-368, 1989.
28. E. Badouel, L. Bernardinello, and P. Darondeau. Polynomial algorithms for the synthesis of bounded nets. Lecture Notes in Computer Science, 915: 647-679, 1995.
29. E. Badouel and P. Darondeau. Theory of regions. Lecture Notes in Computer Science, 1491: 529-586, 1998.
30. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Deriving Petri nets from finite transition systems. IEEE Transactions on Computers, 47(8): 859-882, 1998.
31. R. Bergenthum, J. Desel, R. Lorenz, and S. Mauser. Synthesis of Petri nets from infinite partial languages. In: Proceedings of the 8th International Conference on Application of Concurrency to System Design, Xian, China, 2008, pp. 170-179.
32. J. Carmona, J. Cortadella, A. Kishinevsky, L. Lavagno, A. Kondratyev, and A. Yakovlev. A symbolic algorithm for the synthesis of bounded Petri nets. In: Proceedings of the International Conference on Application and Theory of Petri Nets and Other Models of Concurrency, Xi'an, China, 2008, pp. 92-111.
33. R. Lorenz, G. Juhás, and S. Mauser. How to synthesize nets from languages-a survey. In: Proceedings of 2007 Winter Simulation Conference, Washington DC, 2007, pp. 637-647.
34. R. Lorenz and G. Juhas. Towards synthesis of Petri nets from scenarios. Lecture Notes in Computer Science, 4024: 302-321, 2006.
35. M. E. Meda-Campaña and E. López-Mellado. Incremental synthesis of Petri net models for identification of discrete event systems. In: Proceedings of the 41th IEEE Conference on Decision and Control, Las Vegas, NV, 2002, pp. 805-810.
36. M. E. Meda-Campaña and E. López-Mellado. Required event sequences for identification of discrete event systems. In: Proceedings of the 42th IEEE Conference on Decision and Control, Maui, HI, 2003, pp. 3778-3783.
37. M. P. Cabasino, A. Giua, and C. Seatzu. Identification of Petri nets from samples of their languages. Discrete Events Dynamical Systems, 17(4): 447-474, 2007.
38. M. Dotoli, M. P. Fanti, and A. M. Mangini. Real time identification of discrete event systems using Petri nets. Automatica, 44(5): 1209-1219, 2008.
39. A. Ghaffari, N. Rezg, and X. Xie. Design of a live and maximally permissive Petri net controller using the theory of regions. IEEE Transactions on Robotics and Automation, 19(1): 137-142, 2003.
40. R. Bergenthum, J. Desel, R. Lorenz, and S. Mauser. Process mining based on regions of languages. Lecture Notes in Computer Science, 4714: 375-383, 2007.
41. M. P. Cabasino, A. Giua, and C. Seatzu. Linear programming techniques for the identification of Place/Transition nets. In: Proceedings of the 47th IEEE Conference on Decision and Control, Cancun, Mexico, 2008, pp. 514-520.
42. P. Darondeau. Deriving unbounded Petri nets from formal languages. In Proceedings of the 9th International Conference on Concurrency Theory, London, UK, 2008, pp. 533-548.
43. T. Murata. Synthesis of decision-free concurrent systems for prescribed resources and performance. IEEE Transactions on Software Engineering, SE-6(6): 525-530, 1980.
44. L. Czaja. Marking nets abstract and structured. Lecture Notes in Computer Science, 222: 181-202, 1986.
45. J. Esparza and M. Silva. Top-down synthesis of live and bounded free choice nets. Lecture Notes in Computer Science, 524: 118-139, 1991.
46. P. Graubmann. The construction of EN systems from a given trace behaviour. Lecture Notes in Computer Science, 340: 133-153, 1989.
47. K. Hiraishi. Construction of a class of safe Petri nets by presenting firing sequences. Lecture Notes in Computer Science, 616: 244-262, 1992.
48. A. Bemporad and M. Morari. Control of systems integrating logic, dynamics and constraints. Automatica, 35(3): 407-429, 1999.
49. Y. Ru and C. N. Hadjicostis. State estimation in discrete event systems modeled by labeled Petri nets. In: Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, 2006, pp. 6022-6027.
50. R. S. Sreenivas. On minimal representations of Petri net languages. IEEE Transactions on Automatic Control, 51(5): 799-804, 2006.
51. L. Li, Y. Ru, and C. N. Hadjicostis. Least-cost firing sequence estimation in labeled Petri nets. In: Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, 2006, pp. 416-421.
52. W. M. P. van der Aalst and B. F. van Dongen. Discovering workflow performance models from timed logs. Lecture Notes in Computer Science, 2480: 45-63, 2002.
53. W. M. P. van der Aalst, A. J. M. M. Weijters, and L. Maruster. Workflow mining: which processes can be rediscovered? BETA Working Paper Series, WP 74, Eindhoven University of Technology, Eindhoven, 2002.
54. W. M. P. van der Aalst, A. J. M. M. Weijters, and L. Maruster. Workflow mining: discovering process models from event logs. IEEE Transactions on Data & Knowledge Engineering, 16(9): 1128-1142, 2004.
55. L. Maruster, A. J. M. M. Weijters, W. M. P. van der Aalst, and A. van den Bosch. Process mining: discovering direct successors in process logs. Lecture Notes in Artificial Intelligence, 2534: 364-373, 2002.
56. A. J. M. M. Weijters and W. M. P. van der Aalst. Process mining: discovering work-flow models from event-based data. In: Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence, Amsterdam, The Netherlands, 2001, pp. 283-290.
57. A. J. M. M. Weijters and W. M. P. van der Aalst. Rediscovering workflow models from event-based data. In: Proceedings of the 11th Dutch-Belgian Conference on Machine Learning, Amsterdam, The Netherlands, 2001, pp. 93-100.
58. J. M. E. M. van der Werf, B. F. van Dongen, B. F. Hurkens, and C. A. Serebrenik. Process discovery using integer linear programming. In: Proceedings of the 29th International Conference on Applications and Theory of Petri Nets, Xi'an, China, 2008, pp. 368-387.
59. W. M. P. van der Aalst, B. F. van Dongen, C. W. Gunther, R. S. Mans, A. K. Alves de Medeiros, A. Rozinat, V. Rubin, M. Song, H. M. W. Verbeek, and A. J. M. M. Weijters. ProM 4.0: Comprehensive support for real process analysis. Application and Theory of Petri Nets and Other Models of Concurrency, 4546: 484-494, 2007.
60. J. Carmona, J. Cortadella, and A. Kishinevsky. A region-based algorithm for discovering Petri nets from event logs. In: Proceedings of the 6th International Conference on Business Process Management, Milan, Italy, 2008, pp. 358-373.
61. W. M. P. van der Aalst, B. F. van Dongen, J. Herbst, L. Maruster, G. Schimm, and A. J. M. M. Weijters. Workflow mining: a survey of issues and approaches. IEEE Transactions on Data & Knowledge Engineering, 47(2): 237-267, 2003.
62. W. M. P. van der Aalst. Process Mining: Discovery, Conformance and Enhancement of Business Processes, Springer, 2011.