You are on page 1of 1

372

References

13.

Stuart E. Dreyfus and Averill M. Law. The Art and Theory of Dynamic Pro- gramming. Academic Press, New York, 1977.

14.

Hartmann J. Genrich. Predicate/transition nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course, Bad Honnef, Germany, September 8–19, 1986, volume 254 of LNCS, pages 207–247, Bad Honnef, Germany, 1987. Springer-Verlag.

15.

Hartmann J. Genrich and K. Lautenbach. System modelling with high-level Petri nets. Theoretical Computer Science, 13:109–136, 1981.

16.

Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1st edition, 1997.

17.

Rachel Harrison and Celia A. Glass. Dynamic programming in a pure functional language. In Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing, pages 179–186. ACM Press, 1993.

18.

N.A.J. Hastings. Dynamic Programming with Management Applications. Butterworths, London, England, 1973.

19.

N.A.J. Hastings. DYNACODE Dynamic Programming Systems Handbook. Man- agement Center, University of Bradford, Bradford, England, 1974.

20.

Frederick S. Hillier and Gerald J. Lieberman. Introduction to Operations

Research. McGraw-Hill Publishing Company, New York, 5th edition, 1990.

21.

Frederick S. Hillier and Gerald J. Lieberman. Introduction to Operations Research. McGraw-Hill Publishing Company, Boston, 7th edition, 2001.

22.

Ellis Horowitz, Sartaj Sahni, and Sanguthevar Rajasekaran. Computer Algo- rithms/C++. Computer Science Press, New York, New York, 1996.

23.

T.C. Hu. Combinatorial Algorithms. Addison-Wesley, Reading, 1982.

24.

Matthias Jantzen. Complexity of place/transition nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course, Bad Honnef, Germany, September 8–19, 1986, volume 254 of LNCS, pages 413–434, Bad Honnef, Germany, 1987. Springer-Verlag.

25.

Kurt Jensen. Coloured Petri nets and the invariant-method. Theoretical Com- puter Science, 14:317–336, 1981.

26.

Kurt Jensen. Coloured Petri nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course, Bad Honnef, Germany, Sep- tember 8–19, 1986, volume 254 of LNCS, pages 248–299, Bad Honnef, Germany, 1987. Springer-Verlag.

27.

Kurt Jensen. Coloured Petri Nets, Vol. 1. Springer-Verlag, Berlin, Germany,

1992.

28.

Brian W. Kernighan. Optimal sequential partitions of graphs. Journal of the

ACM, 18(1):34–40, 1971.

29.

Jeffrey H. Kingston. Algorithms and Data Structures: Design, Correctness, Analysis. Addison Wesley Longman, Harlow, England, 2nd edition, 1998.

´

30.

Jon Kleinberg and Eva Tardos. Algorithm Design. Pearson Addison-Wesley, Boston, 2006.

31.

Olaf Kummer. Introduction to Petri nets and reference nets. Sozionik aktuell,

1:7–16, 2001.

32.

Olaf Kummer, Frank Wienberg, and Michael Duvigneau. Renew User Guide Release 1.6. Department of Informatics, University of Hamburg, Hamburg, Germany, 2002.