A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
[chapter]
2001
Lecture Notes in Computer Science
This paper proposes a partial-order semantics for a stochastic process algebra that supports general (non-memoryless) distributions and combines this with an approach to numerically analyse the first passage time of an event. Based on an adaptation of McMillan's complete finite prefix approach tailored to event structures and process algebra, finite representations are obtained for recursive processes. The behaviour between two events is now captured by a partial order that is mapped on a
doi:10.1007/3-540-45319-9_16
fatcat:nxfnhfru4jbe5lilehqbyjxtba