REFERENCES
- J L Peterson, Petri net Theory and the Modeling of systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
- D Angulin, Learning regular sets from queries and counter examples, Information and Control, vol 75, pp 87–106, 1987.
- K Hiraishi, Consltruction of a class of safe Petri nets by presenting firing sequences, in Applications and Theory of Petri Nets, Lecture Notes in Computer Science, 616, Springer, Berlin, 1992, pp 244–262.
- K Thirusangu & K Rangarajan, On the construction of two subclasses of Petri nets, Research volume II, Madras Christian College, 1994, pp 51–62.
- K Thirusangu & K Rangarana, A Note on the cosntruction of marked graphs, Information Processing Letters, vol 55, pp 211–215, 1995.
- T G Dietterich, B London, K Clarkson & G Dromey, Learning and inductive inference, in The Hand Book of Artificial Intelligence (III), P R Cholan & E A Feigenbaum (eds), Kaufmann, Los Altos, CA, 1982, pp 323–512.
- Feng Chu & Xiaolan Xie, Analysis of Petri Nets using siphons and traps, IEEE Transactions on Robotics and Automation, to appear.
- I J Aalbersberg & G Rozenberg, Theory of traces, Theoretical computer Science, pp 1–82, 1988.