Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions
From MaRDI portal
Publication:964840
DOI10.1007/s10626-008-0041-8zbMath1185.93080OpenAlexW2033999368MaRDI QIDQ964840
Publication date: 21 April 2010
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-008-0041-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Blocking a transition in a free choice net and what it tells about its throughput.
- On the exact simulation of functionals of stationary Markov chains
- Extremal throughputs in free-choice nets
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- Products of Irreducible Random Matrices in the (Max, +) Algebra
- Modeling and analysis of timed Petri nets using heaps of pieces
- Free Choice Petri Nets
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Simulating the Invariant Measures of Markov Chains Using Backward Coupling at Regeneration Times
This page was built for publication: Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions