Table of Contents Author Guidelines Submit a Manuscript
International Journal of Computer Games Technology
Volume 2009 (2009), Article ID 162450, 12 pages
http://dx.doi.org/10.1155/2009/162450
Research Article

A Shortest-Path Lyapunov Approach for Forward Decision Processes

1Center for Computing Research, National Polytechnic Institute, Avenue Juan de Dios Batiz s/n, Edificio CIC, Col. Nueva Industrial Vallejo, 07738 Mexico City, Mexico
2Center for Applied Science and High Technology Research, National Polytechnic Institute Legaria 69 Col. Irrigación, 11500 Mexico City, Mexico

Received 1 May 2008; Accepted 7 September 2008

Academic Editor: Abdennour El Rhalibi

Copyright © 2009 Julio B. Clempner. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. P. Bertsekas and J. N. Tsitsiklis, “An analysis of stochastic shortest path problems,” Mathematics of Operations Research, vol. 16, no. 3, pp. 580–595, 1991. View at Publisher · View at Google Scholar
  2. D. Blackwell, “Positive dynamic programming,” in Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 415–418, University of California Press, Berkeley, Calif, USA, June-July 1965.
  3. C. Derman, Finite State Markovian Decision Processes, Academic Press, New York, NY, USA, 1970.
  4. F. Baccelli, G. Cohen, and B. Gaujal, “Recursive equations and basic properties of timed Petri nets,” Journal of Discrete Event Dynamic Systems, vol. 1, no. 4, pp. 415–439, 1992. View at Google Scholar
  5. F. Baccelli, S. Foss, and B. Gaujal, “Structural, temporal and stochastic properties of unbounded free-choice Petri nets,” Rapport de Recherche, INRIA, Sophia Antipolis, France, 1994. View at Google Scholar
  6. R. I. Bahar, E. A. Frohm, C. M. Gaona et al., “Algebraic decision diagrams and their applications,” Formal Methods in System Design, vol. 10, no. 2-3, pp. 171–206, 1997. View at Publisher · View at Google Scholar
  7. G. Ciardo and R. Siminiceanu, “Using edge-valued decision diagrams for symbolic generation of shortest paths,” in Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design (FMCAD '02), M. D. Aagaard and J. W. O'Leary, Eds., vol. 2517 of Lecture Notes in Computer Science, pp. 256–273, Portland, Ore, USA, November 2002.
  8. G. Cohen, S. Gaubert, and J. Quadrat, “Algebraic system analysis of timed Petri nets,” in Idempotency, J. Gunawardena, Ed., Collection of the Isaac Newton Institute, Cambridge University Press, Cambridge, UK, 1998. View at Google Scholar
  9. J. H. Eaton and L. A. Zadeh, “Optimal pursuit strategies in discrete-state probabilistic systems,” Journal of Basic Engineering, vol. 84, pp. 23–29, 1962. View at Google Scholar
  10. B. Gaujal and A. Giua, “Optimal routing of continuous timed Petri nets,” Automatica, vol. 40, no. 9, pp. 1505–1516, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  11. K. Hinderer and K.-H. Waldmann, “The critical discount factor for finite Markovian decision processes with an absorbing set,” Mathematical Methods of Operations Research, vol. 57, no. 1, pp. 1–19, 2003. View at Publisher · View at Google Scholar
  12. K. Hinderer and K.-H. Waldmann, “Algorithms for countable state Markov decision models with an absorbing set,” SIAM Journal on Control and Optimization, vol. 43, no. 6, pp. 2109–2131, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  13. V. Khomenko and M. Koutny, “Verification of bounded Petri nets using integer programming,” Formal Methods in System Design, vol. 30, no. 2, pp. 143–176, 2007. View at Publisher · View at Google Scholar
  14. A. F. Veinott, “Discrete dynamic programming with sensitive discount optimality criteria,” Annals of Mathematical Statistics, vol. 40, no. 5, pp. 1635–1660, 1969. View at Publisher · View at Google Scholar
  15. H.-C. Yen, “A valuation-based analysis of conflict-free Petri nets,” Systems and Control Letters, vol. 45, no. 5, pp. 387–395, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  16. A. S. Poznyak, K. Najim, and E. Gomez-Ramirez, Self-Learning Control of Finite Markov Chains, Marcel Dekker, New York, NY, USA, 2000.
  17. A. Auslender and M. Teboulle, “Interior gradient and proximal methods for convex and conic optimization,” SIAM Journal on Optimization, vol. 16, no. 3, pp. 697–725, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  18. S. Pan and J.-S. Chen, “Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming,” Journal of Global Optimization, vol. 39, no. 4, pp. 555–575, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  19. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, MIT Press and McGraw-Hill, Cambridge, Mass, USA, 2nd edition, 2001.
  20. V. Lakshmikantham, S. Leela, and A. A. Martynyuk, Practical Stability of Nonlinear Systems, World Scientific, Singapore, 1990.
  21. V. Lakshmikantham, V. M. Matrosov, and S. Sivasundaram, Vector Lyapunov Functions and Stability Analysis of Nonlinear Systems, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.
  22. R. E. Kalman and J. E. Bertram, “Control system analysis and design via the “second method” of Lyapunov,” Journal of Basic Engineering, vol. 82(D), pp. 371–393, 1960. View at Google Scholar
  23. J. B. Clempner, “Colored decision process Petri nets: modeling, analysis and stability,” International Journal of Applied Mathematics and Computer Science, vol. 15, no. 3, pp. 405–420, 2005. View at Google Scholar
  24. I. Csiszár, “Information-type measures of difference of probability distribution and indirect observations,” Studia Scientiarum Mathematicarum Hungarica, vol. 2, pp. 299–318, 1967. View at Google Scholar
  25. S. Kullback and R. A. Leibler, “On information and sufficiency,” Annals of Mathematical Statistics, vol. 22, no. 1, pp. 79–86, 1951. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. A. L. Lehninger, D. L. Nelson, and M. M. Cox, Principles of Biochemistry, Worth, New York, NY, USA, 4th edition, 2004.
  27. H. Matsuno, S. Fujita, A. Doi, M. Nagasaki, and S. Miyano, “Towards biopathway modeling and simulation,” in Proceedings of the 24th International Conference on Applications and Theory of Petri Nets (ICATPN '03), vol. 2679 of Lecture Notes in Computer Science, pp. 3–22, Eindhoven, The Netherlands, June 2003. View at Publisher · View at Google Scholar
  28. J. B. Clempner, “Towards modeling the shortest-path problem and games with Petri nets,” in Proceedings of the Doctoral Consortium at the ICATPN, pp. 1–12, Turku, Finland, June 2006.
  29. J. Desel and J. Esparza, “Free choice Petri nets,” in Cambridge Tracts in Theoretical Computer Science, vol. 40, Cambridge University Press, Cambridge, UK, 1995. View at Google Scholar
  30. M. K. Campbell and S. O. Farrell, Biochemistry, Brooks Cole, Florence, Ky, USA, 4th edition, 2002.
  31. K. M. Passino, K. L. Burgess, and A. N. Michel, “Lagrange stability and boundedness of discrete event systems,” Discrete Event Dynamic Systems: Theory and Applications, vol. 5, no. 4, pp. 383–403, 1995. View at Publisher · View at Google Scholar
  32. Z. Retchkiman, “Place-Transitions Petri Nets: Class Notes,” CIC-I.P.N., 1998.
  33. T. Murata, “Petri nets: properties, analysis and applications,” Proceedings of the IEEE, vol. 77, no. 4, pp. 541–580, 1989. View at Publisher · View at Google Scholar