In this thesis, we investigate reliable modelling within a stochastic process algebra framework. Primarily, we consider issues of variance in stochastic process algebras as a measure of model reliability. This is in contrast to previous research in the field which has tended to centre around mean behaviour and steady-state solutions. We present a method of stochastic aggregation for analysing generally-distributed processes. This allows us more descriptive power in representing stochastic systems and thus gives us the ability to create more accurate models. We improve upon two well-developed Markovian process algebras and show how their simpler paradigm can be brought to bear on more realistic synchronisation models. Now, reliable performance figures can be obtained for systems, where previously only approximations of unknown accuracy were possible. Finally, we describe reliability definitions and variance metrics in stochastic models and demonstrate how systems can be made more reliable through careful combination under stochastic process algebra operators.
Recommendations
Stochastic Petri net semantics for stochastic process algebras
PNPM '95: Proceedings of the Sixth International Workshop on Petri Nets and Performance ModelsWe define a stochastic Petri net (SPN) semantics for stochastic process algebras (SPAs), a recently introduced formalism that offers a novel approach for performance modeling. The proposed semantics is evaluated in terms of three criteria: concurrency ...
Limit behavior of the hybrid approximation of stochastic process algebras
ASMTA'10: Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applicationsWe investigate the limit behavior of a class of stochastic hybrid systems obtained by hybrid approximation of Stochastic Concurrent Constraint Programming (sCCP). We prove that a sequence of Continuous Time Markov Chain (CTMC), constructed from sCCP ...
A Characterization of the Stochastic Process Underlying a Stochastic Petri Net
Stochastic Petri nets (SPN's) with generally distributed firing times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange ...