## Abstract

Given a scalar, stationary, Markov process, this short communication presents a closed-form solution for the first-passage problem for a fixed threshold b. The derivation is based on binary processes and the general formula of Siegert [Siegert AJF. On the first-passage time probability problem. Physical Review 1951; 81:617-23]. The relation for the probability density function of the first-passage time is identical to the commonly used formula that was derived by VanMarcke [VanMarcke E. On the distribution of the first-passage time for normal stationary random processes. Journal of Applied Mechanics ASME 1975; 42:215-20] for Gaussian processes. The present derivation is based on more general conditions and reveals the criteria for the validity of the approximation. Properties of binary processes are also used to derive a hierarchy of upper bounds for any scalar process.

Original language | English |
---|---|

Pages (from-to) | 22-26 |

Number of pages | 5 |

Journal | Probabilistic Engineering Mechanics |

Volume | 22 |

Issue number | 1 |

DOIs | |

State | Published - Jan 2007 |

Externally published | Yes |

## Keywords

- Binary process
- First-passage problem
- Markov process