Backward coupling in petri nets

ACM International Conference Proceeding Series

Volumn 180, Issue , 2006, Pages

  Bouillard, Anne ^a   Gaujal, Bruno ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b CNRS   (France)

Author keywords

Max; Perfect simulation(; Petri nets; Plus) algebra

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HIDDEN MARKOV MODELS; SAMPLING; STOCHASTIC MODELS;

EXTREMAL INITIAL STATES; MARKOVIAN EVENT GRAPHS; MONOTONICITY PROPERTY; SAMPLING ALGORITHMS;

PETRI NETS;

EID: 34748907827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190095.1190137     Document Type: Conference Paper

References (15)

1. F. Baccelli, S. Foss, and J. Mairesse. Stationary ergodic jackson networks: Results and counter-examples. Stochastic networks, Oxford Univ. Press, pages 281-307, 1996.
2. F. Baccelli, A. Jean-Marie, and I. Mitrani, editors. Quantitative Methods in Parallel Systems. Basic Research Series. Springer Verlag, 1995.
3. F. Baccelli and J. Mairesse. Idempotency, chapter Ergodic Theory of Stochastic Operators and Discrete Event Networks, pages 171-208. Publications of the Isaac Newton Institute. Cambridge University Press, 1998.
4. A. Bouillard. Optimisation et analyse probabiliste de systèmes à événements discrets. PhD thesis, Ecole Normale Supérieure de Lyon, 2005. In French.
5. A. Bouillard and B. Gaujal. Coupling time of a (max,plus) matrix. In Workshop on Max-Plus Algebras and Their Applications to Discrete-event Systems, Theoretical Computer Science, and Optimization, Prague, 2001. IFAC.
6. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge Tracts in Theorical Computer Science, 1995.
7. G. J. O. F. Baccelli, G. Gohen and J.-P. Quadrat. Synchronization and Linearity. Wiley, 1992.
8. S. Foss, R. Tweedy, and J. Corcoran. Simulating the invariant measures of markov chains using backward coupling at regeneration time. Probability in the Engineering and Informational Sciences, 12:303-320, 1998.
9. S. Gaubert and J. Mairesse. Modeling and analysis of timed Petri nets using heaps of pieces. IEEE Trans. Autom. Control, 44(4):683-697, 1999.
10. B. Gaujal, S.Haar, and J. Mairesse. Blocking a transition in a free choice net, and what it tells about its throughput. Journal of Computer and System Sciences, 66(3):515-548, 2003.
11. O. Häggström. Finite Markov chains and Algorithmic Applications, volume 52 of Student texts. Cambridge University Press, 2002.
12. J. Mairesse. Products of irreducible random matrices in the (max,+) algebra. Adv. Applied Probability, 29(2):444-477, 1997.
13. D. Propp and J. Wilson. Exact sampling with coupled Markov chains and application to statistical mechanics. Random Structures and Algorithms, 9(1):223-252, 1996.
14. J.-M. Vincent and C. Marchand. On the exact simulation of functionals of stationary Markov chains. Linear Algebra and Its Applications, 386:285-310, 2004.
15. A. Walker. An efficient method for generating random variables with general distributions. ACM Trans. Math. Software, pages 253-256, 1974.