Pith. sign in

REVIEW 3 major objections 7 minor 56 references

Utilizing phase-type distributions for queueing-based railway junction performance determination

T0 review · 3 major / 7 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Modeling railway junction arrivals and services with phase-type distributions inside a continuous-time Markov chain estimates route queue lengths and timetable capacity better than exponential queuing models with scaling corrections, and…

desk verdict A clean, reproducible extension of the authors' CTMC junction model to phase-type arrivals and services, but the validation is partly circular and the case-study vS,r values are unexplained. read the letter →

arxiv 2412.04188 v1 pith:7LUWQPAW submitted 2024-12-05 eess.SY cs.SY

Tamme Emunds , Nils Nie{ss}en This is my paper · ORCID
classification eess.SYcs.SY MSC 60K2560J2890B20
keywords phase-typedistributioncontinuous-timeMarkovchainrailwayjunctioncapacitytimetablequeueingtheoryhypoexponentialbottleneckanalysistimetable-independent
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Previously, timetable-independent railway junction performance was computed with an exponential (M/M) queueing model, and non-exponential variability had to be smuggled in through scaling formulas. This paper claims that putting phase-type (hypoexponential) distributions for both the arrival and the service process directly into the continuous-time Markov chain removes that need: the full PH/PH model reproduces simulated queue lengths at the route level and gives the same timetable capacity as simulation around the quality limit, while the exponential variants with or without scaling misjudge capacity, typically by several trains per hour. The payoff is a deterministic, timetable-independent way to find which route is the bottleneck and how many train requests a junction can accept, without running long simulations. The cost is a much larger state space and computation time, which the paper quantifies.

What carries the argument

The carrying object is the phase-type representation of the two stochastic processes: each route's arrival and service processes are modelled as hypoexponential distributions with squared coefficient of variation below one, fitted by the two-Erlang parameterisation: the number of phases is k = ceil(1/$v^{2}$), the phases are split into two Erlang blocks, and the transition rates are set by equations (15)–(19) so that the fitted distribution matches the target coefficient of variation. The CTMC state then contains, for every route, the queue length, the service status, the current arrival phase, and the current service phase; the conflict matrix removes states in which conflicting routes are served simultaneously. Transitions advance phases with rates λr,a/λr,b and µr,a/µr,b, and a high-rate choice transition starts service for one of several waiting routes. Expected route queue lengths are read off the stationary distribution, and timetable capacity is found by a root-finding loop that compares the worst route's quality factor to 1.

What would settle it

Recompute the case-study timetable capacity with the same headway times but with service-time variation coefficients vS,r shifted from the values in Table 8 to, say, 0.2 and 0.4; if the capacity estimate moves by more than the model's claimed approximation error, then the reliability of the method as a scaling-free tool depends on an input the paper does not derive. A complementary check is to reconstruct vS,r directly from the headway distributions and confirm that a model checking run reproduces nmax = 11.93 at pmain = 0.5.

Watch

Extended reading notes

Core claim

The central claim is that a continuous-time Markov chain whose states track the phase of a hypoexponential arrival process and a hypoexponential service process for every route—not just the queue length and service status—can estimate route-based expected queue lengths and, from them, timetable capacity for a railway junction. In the validation junction, the PH/PH model's queue-length curve is almost congruent with simulation for train counts up to about 23 per hour; beyond that, the analytical model's finite waiting slots (m=5) cause underestimation, but near the quality threshold Llimit=0.13 the PH/PH estimate is adequate and needs no scaling function. By contrast, the unscaled M/M, PH/M, and M/PH models would allow only 12–14.5 trains per hour against roughly 17 for simulation and PH/PH. With the scaling formulas applied, M/M becomes competitive for homogeneous traffic but still misses the capacity pattern for very unequal traffic splits, and PH/M or M/PH remain biased in one direction or the other. The paper therefore recommends the full PH/PH model for accurate, detailed junction analysis and the scaled M/M model only for a quick first pass.

Load-bearing premise

The load-bearing premise is that the per-route service-time variation coefficients listed for the case study are correct, because the number of phases, the size of the Markov chain, and the resulting timetable capacity all depend on those values, and the paper does not show how they were obtained.

Editorial extensions

If this is right

  • Infrastructure managers can obtain a deterministic, timetable-independent estimate of junction capacity without building a timetable or running hours of simulation.
  • The method exposes route-level bottlenecks through the quality factor, since the route with the highest queue-to-threshold ratio saturates first.
  • Using the full PH/PH model changes the recommended traffic split for capacity: maximum capacity occurs at homogeneous traffic or heavily skewed traffic, not at intermediate mixes.
  • Analysts who need only a rough early figure can keep the scaled M/M model, but they should expect errors of up to several trains per hour outside homogeneous traffic.
  • The exponential-by-approximation road leads to a quality threshold violation earlier than the phase-type model, so expansion decisions based on the old method will be conservative.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The method's practical reliability is only as good as the per-route service-time variation coefficient, which is case-study input; a sensitivity analysis over plausible vS values would tell planners how much margin to keep in their capacity numbers.
  • The same two-Erlang phase-type construction could be transferred to other transport or service networks whose arrival and service processes have coefficients of variation below one, such as signalised intersections or terminal handling, as long as a conflict matrix can encode shared resources.
  • Because the finite waiting slots m cause underestimation in heavy traffic, an extension with larger m or closed-form infinite-capacity corrections would be needed before using the PH/PH queue lengths to judge very congested junctions.
  • The quality threshold used to convert queue lengths into capacity was designed for line capacity, so re-calibrating thresholds for multi-channel junctions could change the computed timetable capacity even if the queue-length estimates are perfect.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 7 minor

Summary. The paper extends a previously published Continuous-Time Markov Chain (CTMC) model for timetable-independent railway junction capacity analysis by allowing phase-type distributed inter-arrival and service times. Arrival and service processes are represented by hypoexponential distributions fitted through a two-Erlang-block procedure using only mean and coefficient of variation. Expected route queue lengths are obtained by building the CTMC in PRISM and solving it with Storm, and timetable capacity is found by a Brent root-finding algorithm. The model is compared with M/M, PH/M, M/PH and PH/PH combinations, with and without Hertel and Kingman scaling, against discrete-event simulation in SimPy/Ciw, and is applied to a mixed freight/passenger junction case study. The central claim is that the PH/PH model gives adequate queue-length estimates near the quality limit and matches simulation better than the scaled exponential models.

Significance. If the claims are properly scoped, this is a useful methodological contribution: it replaces ad hoc scaling formulas with a direct phase-type construction inside a CTMC, which is a natural extension of the authors' earlier work. The paper has clear strengths: the model construction is explicit, the implementation is backed by a public repository with PRISM models and code, the comparison across four distribution combinations and two approximation formulas is systematic, and the capacity-determination algorithm is a practical contribution. The computed results are deterministic, unlike simulation, and the runtime comparison is informative. However, the validation as presented establishes consistency between the CTMC solver and a discrete-event simulator that shares the same phase-type distributional assumption; it does not establish that the assumed two-moment hypoexponential fits capture real junction headway and service processes. The case study also omits the derivation of the service variation coefficients that drive the phase counts and model size. With these points addressed, the paper would be a solid contribution to analytical railway capacity planning.

major comments (3)
  1. [Section 5, simulation setup and Section 5.2] The validation is circular with respect to the distributional assumption. In Section 5, the simulation is described as drawing inter-arrival and service times from phase-type distributions fitted according to Section 4.3.1, the same fitting procedure used in the analytical CTMC. Therefore Figures 4 and 5 demonstrate that the PH/PH CTMC solves the same PH/PH queueing model as the simulator, not that PH/PH is a better model of real junction processes than M/M with scaling. The sentence in Section 5.2 that the PH/PH model 'gives an adequate estimation in the neighborhood of the limit and can therefore be used without any scaling functions' overstates the evidence, as does the abstract's claim that the method 'enables infrastructure managers to accurately model stochastic processes.' I recommend rephrasing these claims as validation of the analytical solver against stochastic simulation under a common PH/PH assumption, and, if the stronger claim is intended, adding a sensitivity experiment in which the simulator draws from non-PH distributions (e.g., lognormal, deterministic, or empirical headway distributions) with the same mean and coefficient of variation.
  2. [Section 6.1, Table 8] The service variation coefficients vS,r in Table 8 are presented without any formula, derivation, or citation. These values determine the number of phases, the size of the CTMC (millions of states), and ultimately the timetable capacity results in Section 6.2, so the case study is not independently reproducible. Section 7 states that the value is 'calculated based on minimum headway times,' but the calculation itself is never shown. Please provide the explicit formula for vS,r in terms of the headway matrix and traffic shares, or cite a source and show at least one worked value, for example for pmain = 0.5.
  3. [Section 5.2 and Section 4.3.3] The finite waiting-slot truncation m = 5 is a free parameter whose impact is acknowledged only qualitatively. The text explains that PH/PH and simulation diverge above ntotal ≈ 23 because the analytical model caps queues at m = 5 while the simulator does not, but no sensitivity analysis or convergence criterion is given for m. This matters because the quality threshold Llimit in the example is low (0.13); for routes or scenarios with higher thresholds (e.g., freight-dominated traffic, where Llimit is larger), the crossing of the quality limit could occur in the regime where the truncation bias is non-negligible. Please report the sensitivity of nmax and of the queue-length estimates to m, or provide a rule for choosing m large enough that the truncation error is negligible in the region of the quality threshold.
minor comments (7)
  1. [Equation (25)] In the state-space restriction formula, the term s_j(j) should read s_j(u); as written it uses the index j as an argument of the service-status function.
  2. [Section 4.3.3 and Section 4.3.4] The phase indexing is inconsistent: equation (24) defines pA,r and pS,r as taking values in {0, ..., k-1}, while the transition rules in equations (26)-(32) reset phases to 1 and refer to p = k as the final phase. Please clarify whether phases are 0-based or 1-based and adjust the transition conditions accordingly.
  3. [Section 4.3.4] The conditions 'pA,r(u) ≤ k*_{A,r}' and 'k*_{A,r} ≤ pA,r(u) ≤ k_{A,r}' overlap at p = k*, and similarly for the service transitions. Use strict inequalities on one side to make the rate-change boundary unambiguous.
  4. [Algorithm 1, Appendix A] Line 3 of Algorithm 1 reads 'Determine arrival rate λr = 1/nr'; this should be λr = nr/tU, since λr is a rate per minute and nr is a count. As printed, the dimension is inverted.
  5. [Section 5.3] The first paragraph says the algorithm assumes monotonicity of the function ELr : Pmain × Ntotal → R, but equation (36) defines ELr : Ntotal → R with pmain fixed. The domain in the text should be Ntotal only, with pmain treated as a parameter.
  6. [Algorithm 1, Appendix A] Line 12 lists the phase-type parameters as 'kA,r, kS,r, λr,a, λr,b, µr,a, µr,a'; the last parameter should be µr,b.
  7. [Figure 4] The y-axis tick labels render as '10□2', '10□1', '10□0', '10□1'; the superscripts appear to be lost in the typesetting and should be repaired.

Circularity Check

1 steps flagged · score 6.0 of 10

PH/PH validation is partially circular: the simulation baseline is generated from the same phase-type fits as the analytical model, so the claimed adequacy of PH/PH is mostly an internal consistency check rather than evidence about real GI/GI railway processes.

  1. self definitional [Section 5 (simulation setup, after Table 3) and Section 5.2 (adequacy claim)]
    "In the simulation, inter-arrival times and service times are drawn randomly from phase-type distributions fitted according to Section 4.3.1 for every route. ... the PH/PH model gives an adequate estimation in the neighborhood of the limit and can therefore be used without any scaling functions to evaluate the performance of the example railway junction."

    The validation target (simulation results) is constructed from the same phase-type fitting procedure (Section 4.3.1) that defines the arrival and service processes in the PH/PH CTMC. Consequently, agreement between PH/PH and simulation shows that the CTMC solver and the discrete-event simulator solve the same PH/PH queueing model consistently; it cannot test whether the two-Erlang-block hypoexponential fit, determined only by mean and coefficient of variation, represents actual railway arrival/service processes. The paper's central adequacy claim is therefore supported by a benchmark that is self-defined in terms of the assumption being validated.

full rationale

The extension of the CTMC to phase-type distributions (Section 4.3) is a genuine modeling contribution: the state-space construction, transition rates, model checking, and capacity root-finding are implemented independently of the simulation. However, the validation in Section 5 uses a simulation whose inter-arrival and service times are drawn from phase-type distributions fitted exactly as in Section 4.3.1 (quote above). The PH/PH curve in Figure 4a and capacity curves in Figure 5a therefore compare the analytical CTMC to a discrete-event simulation of the same PH/PH process; their near-coincidence verifies internal consistency of the two numerical methods but does not validate the PH/PH assumption as an approximation of real GI/GI railway traffic. The comparison among M/M, PH/M, M/PH, and PH/PH is still informative about the sensitivity to distributional assumptions within the simulation's assumed world, and the Hertel/Kingman scaling comparisons are not constructed to agree by design. Separately, Section 7 acknowledges that accurate estimation of the service-time variation coefficient is 'essential to ensure the generation of reliable and usable results,' but Table 8 lists the case-study vS,r values without formula, derivation, or citation, making the example-junction results hard to reproduce; this is a missing-support issue rather than a circular step. Weighing these, the central 'adequate estimation' claim overreaches the evidence because its benchmark is generated from the same fitted phase-type distributions, giving partial circularity (score 6) rather than a fully self-contained validation.

Assumptions & free parameters 2 free parameters · 7 assumptions · 0 invented entities

The paper's central claims rest primarily on domain assumptions inherited from railway planning practice and prior queueing literature. The phase-type fitting, the quality threshold, and the coefficients of variation are not derived here; the paper's contribution is the CTMC construction and the comparative analysis. The vS,r inputs for the case study are an unexplained load-bearing input.

free parameters (2)
  • Choice transition rate M = 600 per minute
    Artificial transitions at rate M model immediate service decisions when multiple routes could start. M is chosen by hand; the induced delay 1/600 minute is assumed negligible (Section 4.3.4).
  • Number of waiting slots m = 5
    The CTMC queue length is truncated to m waiting slots to bound the state space. The paper acknowledges this causes underestimation of queue lengths at high occupancy (Section 5.2); the simulation uses unlimited queues.
assumptions (7)
  • domain assumption Arrival and service processes on each route are renewal processes adequately characterized by their coefficients of variation vA=0.8 and vS=0.3.
    Invoked in Sections 3 and 5; these values come from German planning rules (DB InfraGO), not from data analyzed in this paper.
  • domain assumption Hypoexponential phase-type distributions with k = ceil(1/v^2) phases and two Erlang segments can approximate any GI distribution with v<1.
    Used in Section 4.3.1; the parameter fitting is taken from Weik (2020) and Sommereder (2011). The approximation quality of this fitting is assumed, not derived in this paper.
  • domain assumption The junction can be decomposed into independent per-route queues with a conflict matrix and FIFO or choice-based service discipline.
    Introduced in Section 3 and Section 4.3.3; independence across routes is an idealization of real interlocking behavior.
  • domain assumption The quality threshold Llimit,r = 0.479*exp(-1.3*ppt,r) applies to route-based junction queues.
    Taken from Schwanhäußer and Schultze (1982) and used in Sections 4.1 and 6; authors note in Section 7 that this threshold was designed for line capacities and may need revisiting for multi-channel systems.
  • standard math The CTMC is ergodic and its stationary distribution correctly gives expected queue lengths.
    Relies on the finite state space and standard CTMC theory; the stationary distribution is computed with the Storm model checker (Section 4.4).
  • domain assumption Service-time variance coefficients vS,r in the case study are computed from minimum headway times, but the calculation is not shown.
    Section 6.1 and Table 8 list vS,r values without derivation; results depend strongly on these values, as the authors state in Section 7.
  • domain assumption ELr(ntotal) is monotonic in ntotal, so Brent's method converges to the unique capacity root.
    Assumed in Section 4.5; acknowledged as not guaranteed for simulations in Appendix B, but assumed for the CTMC.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Utilizing phase-type distributions for queueing-based railway junction performance determination." pith.science (2026). https://pith.science/paper/7LUWQPAW

@misc{pith2026241204188,
  author       = {Pith},
  title        = {Pith review of: Utilizing phase-type distributions for queueing-based railway junction performance determination},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7LUWQPAW}},
  note         = {Machine review of arXiv:2412.04188}
}
read the original abstract

To ensure the effective and objective development of transportation networks, it is crucial to identify performance limitations across various subsystems. A timetable-independent assessment of infrastructure capacity at railway junctions is a fundamental aspect of long-term rail network planning. While recent research introduced queueing-based methods to quantify route-based railway junction performance, modelling arrival and service processes has been limited to exponential distributions. This work utilizes Phase-Type Distributions to propose an extension to a previously described Continuous-Time Markov Chain model. In a comparison between assumed distribution combinations, the effect of a more detailed stochastic process modelling is described. Furthermore, an analysis of the differences to a simulation method is conducted for an exemplary railway junction. The introduced method enables infrastructure managers to accurately model stochastic processes for performance determination in the early stages of the strategic planning phase.

Figures

Figures reproduced from arXiv: 2412.04188 by the authors.

Figure 1
Figure 1. Examplary infrastructure of a railway junction [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Examples of the service process with exponential (M) or phase-distributed (Ph) [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. Mean computation times of all considered models [PITH_FULL_IMAGE:figures/full_fig_p021_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: Comparison of the queue-length estimations at route [PITH_FULL_IMAGE:figures/full_fig_p024_4.png]
Figure 5
Figure 5. Figure 5: Comparison of the performance determination by the share of main line traffic [PITH_FULL_IMAGE:figures/full_fig_p026_5.png]
Figure 6
Figure 6. Figure 6: Traffic scenario of the case study Consistent with the introduced notation, the line to the passenger station ’B’ is called main line and the line to the freight yard ’C’ branch line. For the railway junction infrastructure itself, we consider the same infrastructure a…
Figure 7
Figure 7. Figure 7: Infrastructure of the considered railway junction [PITH_FULL_IMAGE:figures/full_fig_p029_7.png]
Figure 8
Figure 8. Figure 8: highlights the convergence of the method for a the described example with a main line traffic share of pmain = 0.5. 0 2 4 6 8 No. iteration 0 10 20 30 40 ntotal [PITH_FULL_IMAGE:figures/full_fig_p031_8.png]
Figure 9
Figure 9. Figure 9: Timetable capacity nmax of the two models PH/PH and M/M and quality factor per route for varying pmain 32 [PITH_FULL_IMAGE:figures/full_fig_p032_9.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

56 extracted references · 51 canonical work pages

  1. [1]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in ":" * " " * FUNCTION f...

  2. [2]

    , author Barber, F

    author Abril, M. , author Barber, F. , author Ingolotti, L. , author Salido, M.A. , author Tormos, P. , author Lova, A. , year 2008 . title An assessment of railway capacity . journal Transportation Research Part E: Logistics and Transportation Review volume 44 , pages 774--806 . :10.1016/j.tre.2007.04.001

    work page doi:10.1016/j.tre.2007.04.001 2008

  3. [3]

    , author Asmussen, S

    author Asmussen, S. , author Asmussen, S. , author Asmussen, S. , year 2003 . title Applied probability and queues . volume volume 2 . publisher Springer

    work page 2003

  4. [4]

    , author Goverde, R.M.P

    author Be s inovi \'c , N. , author Goverde, R.M.P. , year 2018 . title Capacity assessment in railway networks , in: editor Bornd \"o rfer, R. , editor Klug, T. , editor Lamorgese, L. , editor Mannino, C. , editor Reuther, M. , editor Schlechte, T. (Eds.), booktitle Handbook of Optimization in the Railway Industry . publisher Springer International Publi...

    work page 2018

  5. [5]

    , year 1973

    author Brent, R. , year 1973 . title Algorithms for minimization without derivatives . journal Prentice-Hall, Englewood Cliffs NJ

    work page 1973

  6. [6]

    , year 2016

    author Burdett, R.L. , year 2016 . title Optimisation models for expanding a railway's theoretical capacity . journal European Journal of Operational Research volume 251 , pages 783--797 . :10.1016/j.ejor.2015.12.033

    work page doi:10.1016/j.ejor.2015.12.033 2016

  7. [7]

    , author Kozan, E

    author Burdett, R.L. , author Kozan, E. , year 2006 . title Techniques for absolute capacity determination in railways . journal Transportation Research Part B: Methodological volume 40 , pages 616--632 . :10.1016/j.trb.2005.09.004

    work page doi:10.1016/j.trb.2005.09.004 2006

  8. [8]

    , author Furini, F

    author Cacchiani, V. , author Furini, F. , author Kidd, M.P. , year 2016 . title Approaches to a real-world train timetabling problem in a railway node . journal Omega volume 58 , pages 97--110 . :10.1016/j.omega.2015.04.006

    work page doi:10.1016/j.omega.2015.04.006 2016

Show all 56 references
  1. [9]

    , author Toth, P

    author Cacchiani, V. , author Toth, P. , year 2012 . title Nominal and robust train timetabling problems . journal European Journal of Operational Research volume 219 , pages 727--737 . :10.1016/j.ejor.2011.11.003

    2012 doi

  2. [10]

    , year 1955

    author Cox, D.R. , year 1955 . title A use of complex probabilities in the theory of stochastic processes , in: booktitle mathematical proceedings of the Cambridge philosophical society , organization Cambridge University Press . pp. pages 313--319

    1955

  3. [11]

    , author Botte, M

    author D'Acierno, L. , author Botte, M. , author Pignatiello, G. , year 2019 . title A simulation-based approach for estimating railway capacity . journal International Journal of Transport Development and Integration volume 3 , pages 232--244 . :10.2495/TDI-V3-N3-232-244

    2019 doi

  4. [12]

    , author Larry, S

    author David, A. , author Larry, S. , year 1987 . title The least variable phase type distribution is erlang . journal Stochastic Models volume 3 , pages 467--473

    1987

  5. [13]

    title Richtlinie Fahrwegkapazit \"a t

    author DB InfraGO , year 2022 . title Richtlinie Fahrwegkapazit \"a t

    2022

  6. [14]

    title Nutzungsbedingungen Netz der DB Netz AG

    author DB InfraGO , year 2023 . title Nutzungsbedingungen Netz der DB Netz AG

    2023

  7. [15]

    , author Heidergott, B

    author De Kort, A.F. , author Heidergott, B. , author Ayhan, H. , year 2003 . title A probabilistic (max, +) approach for determining railway infrastructure capacity . journal European Journal of Operational Research volume 148 , pages 644--661 . :10.1016/S0377-2217(02)00467-8

    2003 doi

  8. [16]

    , author Nie en, N

    author Emunds, T. , author Nie en, N. , year 2024 a. title Evaluating railway junction infrastructure: A queueing-based, timetable-independent analysis . journal Transportation Research Part C: Emerging Technologies volume 165 , pages 104704 . :10.1016/j.trc.2024.104704

    2024

  9. [17]

    , author Nie en, N

    author Emunds, T. , author Nie en, N. , year 2024 b. title Research Data and Code : Utilizing phase-type distributions for queueing-based railway junction performance determination . :10.5281/ZENODO.14281662

    2024 doi

  10. [18]

    , author Hertel, G

    author Fischer, K. , author Hertel, G. , year 1990 . title Bedienungsprozesse im Transportwesen: Grundlagen und Anwendungen der Bedienungstheorie . publisher Transpress-Verlag

    1990

  11. [19]

    , year 2007

    author Goverde, R.M. , year 2007 . title Railway timetable stability analysis using max-plus system theory . journal Transportation Research Part B: Methodological volume 41 , pages 179--201 . :10.1016/j.trb.2006.02.003

    2007 doi

  12. [20]

    , author Corman, F

    author Goverde, R.M. , author Corman, F. , author D'Ariano, A. , year 2013 . title Railway line capacity consumption of different railway signalling systems under scheduled and disturbed conditions . journal Journal of Rail Transport Planning & Management volume 3 , pages 78--...

    2013 doi

  13. [21]

    , year 1976

    author Gudehus, T. , year 1976 . title Staueffekte vor Transportknoten . journal Zeitschrift f \"u r Operations Research volume 20 , pages B207--B252 . :10.1007/BF01918395

    1976 doi

  14. [22]

    , author Pachl, J

    author Hansen, I. , author Pachl, J. , year 2014 . title Railway timetabling and operations: Analysis, modelling, optimisation, simulation, performance, evaluation . publisher Eurail press

    2014

  15. [23]

    , year 2009

    author Harrod, S. , year 2009 . title Capacity factors of a mixed speed railway network . journal Transportation Research Part E: Logistics and Transportation Review volume 45 , pages 830--841 . :10.1016/j.tre.2009.03.004

    2009 doi

  16. [24]

    , author Junges, S

    author Hensel, C. , author Junges, S. , author Katoen, J.P. , author Quatmann, T. , author Volk, M. , year 2022 . title The probabilistic model checker storm . journal International Journal on Software Tools for Technology Transfer volume 24 , pages 589--610 . :10.1007/s10009-...

    2022 doi

  17. [25]

    o sung zur berechnung der wartegleiszahl vor im einrichtungsbetrieb befahrenen streckengleisen bei nicht-poisson-ank \

    author Hertel, G. , year 1984 . title Exakte l \"o sung zur berechnung der wartegleiszahl vor im einrichtungsbetrieb befahrenen streckengleisen bei nicht-poisson-ank \"u nften (g/m/1-wartesystem) . journal Wissenschaftliche Zeitschrift der Hochschule f \"u r Verkehrswesen volu...

    1984

  18. [26]

    , author Schmidt, M

    author Jensen, L.W. , author Schmidt, M. , author Nielsen, O.A. , year 2020 . title Determination of infrastructure capacity in railway networks without the need for a fixed timetable . journal Transportation Research Part C: Emerging Technologies volume 119 , pages 102751 . :...

    2020

  19. [27]

    , author Volk, M

    author Junges, S. , author Volk, M. , year 2023 . title Stormpy - python bindings for storm: Version 1.7.0 . https://moves-rwth.github.io/stormpy/index.html

    2023

  20. [28]

    , year 1953

    author Kendall, D.G. , year 1953 . title Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded markov chain . journal The Annals of Mathematical Statistics , pages 338--354

    1953

  21. [29]

    , year 1961

    author Kingman, J.F.C. , year 1961 . title The single server queue in heavy traffic . journal Mathematical Proceedings of the Cambridge Philosophical Society volume 57 , pages 902--904 . :10.1017/S0305004100036094

    1961 doi

  22. [30]

    , author Norman, G

    author Kwiatkowska, M. , author Norman, G. , author Parker, D. , year 2011 . title PRISM 4.0: Verification of probabilistic real-time systems , in: editor Gopalakrishnan, G. , editor Qadeer, S. (Eds.), booktitle Proc. 23rd International Conference on Computer Aided Verificatio...

    2011

  23. [31]

    , author Li, H

    author Liao, Z. , author Li, H. , author Miao, J. , author Corman, F. , year 2021 . title Railway capacity estimation considering vehicle circulation: Integrated timetable and vehicles scheduling on hybrid time-space networks . journal Transportation Research Part C: Emerging ...

    2021

  24. [32]

    , author Larsen, J

    author Lusby, R. , author Larsen, J. , author Ryan, D. , author Ehrgott, M. , year 2011 . title Routing trains through railway junctions: A new set-packing approach . journal Transportation Science volume 45 , pages 228--245 . :10.1287/trsc.1100.0362

    2011

  25. [33]

    , author Wolfler Calvo , R

    author Mussone, L. , author Wolfler Calvo , R. , year 2013 . title An analytical approach to calculate the capacity of a railway system . journal European Journal of Operational Research volume 228 , pages 11--23 . :10.1016/j.ejor.2012.12.027

    2013 doi

  26. [34]

    o en f \

    author Nie en, N. , year 2008 . title Leistungskenngr \"o en f \"u r Gesamtfahrstra enknoten . Ph.D. thesis. Verkehrswissenschaftliches Institut der RWTH Aachen (german only)

    2008

  27. [35]

    , year 2013

    author Nie en , N. , year 2013 . title Waiting and loss probabilities for route nodes , in: booktitle International Conference on Railway Operations Modelling and Analysis (RailCopenhagen)

    2013

  28. [36]

    , author Knight, V.A

    author Palmer, G.I. , author Knight, V.A. , author Harper, P.R. , author Hawa, A.L. , year 2019 . title Ciw: An open-source discrete event simulation library . journal Journal of Simulation volume 13 , pages 68--82 . :10.1080/17477778.2018.1473909

    2019

  29. [37]

    , author Norman, G

    author Parker, D. , author Norman, G. , author Kwiatkowska, M. , year 2000 . title Prism . https://www.prismmodelchecker.org/

    2000

  30. [38]

    o mungslehre - Die Zugfolge auf Strecken und in Bahnh \

    author Potthoff, G. , year 1970 . title Verkehrsstr \"o mungslehre - Die Zugfolge auf Strecken und in Bahnh \"o fen . publisher Transpress (german only)

    1970

  31. [39]

    title Python 3.10.9

    author Python Software Foundation , year 2022 . title Python 3.10.9 . https://docs.python.org/release/3.10.9/index.html

    2022

  32. [40]

    , author Weik, N

    author Schmitz, C. , author Weik, N. , author Zieger, S. , author Nie en, N. , author Schmeink, A. , year 2017 . title Markov models for the performance analysis of railway networks , in: booktitle International Conference on Railway Operations Modelling and Analysis (RailLill...

    2017

  33. [41]

    a u er, W. , year 1974 . title Die Bemessung der Pufferzeiten im Fahrplangef \

    author Schwanh \"a u er, W. , year 1974 . title Die Bemessung der Pufferzeiten im Fahrplangef \"u ge der Eisenbahn . Ph.D. thesis. Verkehrswissenschaftliches Institut der Rheinisch-Westf \"a lischen Technischen Hochschule Aachen (german only)

    1974

  34. [42]

    a u er, W. , year 1978 . title Die ermittlung der leistungsf \

    author Schwanh \"a u er, W. , year 1978 . title Die ermittlung der leistungsf \"a higkeit von gro en fahrstra enknoten und von teilen des eisenbahnetzes . journal Archiv f \"u r Eisenbahntechnik volume 1978 , pages 7--18

    1978

  35. [43]

    a tsma st \

    author Schwanhäußer , W. , author Schultze, K. , year 1982 . title Ermittlung von Qualit \"a tsma st \"a ben f \"u r die Berechnung der Leistungsf \"a higkeit eines Streckenabschnittes und Entwicklung eines Rechenverfahrens zur Ermittlung von Endversp \"a tungen: Forschungsarb...

    1982

  36. [44]

    , year 2011

    author Sommereder, M. , year 2011 . title Modelling of Queueing Systems with Markov Chains: An Introduction to Basic and Advanced Modelling Techniques . publisher BoD--Books on Demand

    2011

  37. [45]

    title Simpy 4.0.1

    author Team SimPy Revision , year 2023 . title Simpy 4.0.1 . https://simpy.readthedocs.io/en/4.0.1/

    2023

  38. [46]

    title Ciw: v3.2.2

    author The Ciw library developers , year 2024 . title Ciw: v3.2.2 . :10.5281/zenodo.12667778

    2024 doi

  39. [47]

    title Code 406 - C apacity

    author UIC , year 2004 . title Code 406 - C apacity

    2004

  40. [48]

    title Code 406 - Capacity

    author UIC , year 2013 . title Code 406 - Capacity

    2013

  41. [49]

    , author Drake Jr, F.L

    author Van Rossum, G. , author Drake Jr, F.L. , year 1995 . title Python tutorial . publisher Centrum voor Wiskunde en Informatica Amsterdam, The Netherlands

    1995

  42. [50]

    , author Gommers, R

    author Virtanen, P. , author Gommers, R. , author Oliphant, T.E. , author Haberland, M. , author Reddy, T. , author Cournapeau, D. , author Burovski, E. , author Peterson, P. , author Weckesser, W. , author Bright, J. , author van der Walt , S.J. , author Brett, M. , author Wi...

    2020

  43. [51]

    , year 2020

    author Weik, N. , year 2020 . title Long-Term Capacity Planning of Railway Infrastructure – A Stochastic Approach Capturing Infrastructure Unavailability . Ph.D. thesis. RWTH Aachen University . :10.18154/RWTH-2020-06771

    2020 doi

  44. [52]

    , author Nie en, N

    author Weik, N. , author Nie en, N. , year 2017 . title A quasi-birth-and-death process approach for integrated capacity and reliability modeling of railway systems . journal Journal of Rail Transport Planning & Management volume 7 , pages 114--126 . :10.1016/j.jrtpm.2017.06.001

    2017 doi

  45. [53]

    , year 2007

    author Wendler, E. , year 2007 . title The scheduled waiting time on railway lines . journal Transportation Research Part B: Methodological volume 41 , pages 148--158 . :10.1016/j.trb.2006.02.009

    2007 doi

  46. [54]

    , author Nikoo, N

    author Yaghini, M. , author Nikoo, N. , author Ahadi, H.R. , year 2014 . title An integer programming model for analysing impacts of different train types on railway line capacity . journal Transport volume 29 , pages 28--35 . :10.3846/16484142.2014.894938

    2014

  47. [55]

    , author Weik, N

    author Zieger, S. , author Weik, N. , author Nie en, N. , year 2018 . title The influence of buffer time distributions in delay propagation modelling of railway networks . journal Journal of Rail Transport Planning & Management volume 8 , pages 220--232 . :10.1016/j.jrtpm.2018.09.001

    2018 doi

  48. [56]

    , author Kroon, L.G

    author Zwaneveld, P.J. , author Kroon, L.G. , author Romeijn, H.E. , author Salomon, M. , author Dauz \`e re-P \'e r \`e s, S. , author van Hoesel , S.P.M. , author Ambergen, H.W. , year 1996 . title Routing trains through railway stations: Model formulation and algorithms . j...

    1996 doi

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.