https://github.com/adolgert/competingclocks.jl
Simplest simulation to use non-Exponential transitions
https://github.com/adolgert/competingclocks.jl
continuous-time discrete-event-systems generalized-semi-markov-processes gillespie-algorithm next-reaction-method stochastic-simulation
Last synced: about 2 months ago
JSON representation
Simplest simulation to use non-Exponential transitions
- Host: GitHub
- URL: https://github.com/adolgert/competingclocks.jl
- Owner: adolgert
- License: mit
- Created: 2021-02-14T18:58:05.000Z (about 5 years ago)
- Default Branch: main
- Last Pushed: 2025-11-22T22:23:23.000Z (5 months ago)
- Last Synced: 2025-11-23T00:08:42.954Z (5 months ago)
- Topics: continuous-time, discrete-event-systems, generalized-semi-markov-processes, gillespie-algorithm, next-reaction-method, stochastic-simulation
- Language: Julia
- Homepage:
- Size: 13.3 MB
- Stars: 6
- Watchers: 3
- Forks: 0
- Open Issues: 10
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# CompetingClocks
[](https://adolgert.github.io/CompetingClocks.jl/stable)
[](https://adolgert.github.io/CompetingClocks.jl/dev)
[](https://github.com/adolgert/CompetingClocks.jl/actions)
CompetingClocks samples continuous-time probability distributions with time-varying hazard rates. It is a sampler for stochastic simulation in continuous time. You give it the probability distribution functions, and it tells you which fires next.
This package was formerly called `Fleck`.