Optimis-ing a coloured Petri net simulator

[1]  Jean-Michel Ilié,et al.  On Well-Formed Nets and Optimizations in Enabling Tests , 1993, Application and Theory of Petri Nets.

[2]  Andrew W. Appel,et al.  A Standard ML compiler , 1987, FPCA.

[3]  Lawrence Charles Paulson,et al.  ML for the working programmer , 1991 .

[4]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[5]  Søren Christensen,et al.  A General Systematic Approach to Arc Extensions for Coloured Petri Nets , 1994, Application and Theory of Petri Nets.

[6]  Robert E. Tarjan,et al.  Self-adjusting binary trees , 1983, STOC.

[7]  Gert Scheschonk,et al.  Simulation and Analysis of a Document Storage System , 1994, Application and Theory of Petri Nets.

[8]  Ludmila Cherkasova,et al.  On Net Modeling of Industrial Size Concurrent Systems , 1993, Application and Theory of Petri Nets.

[9]  Søren Christensen,et al.  Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs , 1992 .

[10]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[11]  Andrew W. Appel,et al.  Standard ML of New Jersey , 1991, PLILP.

[12]  Paul G. Hoel,et al.  Introduction to Probability Theory , 1972 .

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  Edward M. Reingold,et al.  Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..