Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
WESTFALISCHE COMPUTER SCIENCE 2
 

Summary: RHEINISCH-
WESTF¨ALISCHE
TECHNISCHE
HOCHSCHULE
AACHEN 2
CHAIR OF
COMPUTER SCIENCE 2
SOFTWARE MODELING
AND VERIFICATION
(MOVES)
- BSc/MSc/Diploma Thesis -
Weighted Lumpability on Markov Chains
Develop and Implement an efficient quotienting algorithm for weighted lumpability
What is it all about?
Continuous-time Markov chains (CTMCs) have a wide applicability ranging from classical performance evaluation to
systems biology. Model checking algorithms for CTMCs against CSL, CSLTA
, and DTA have been developed in the
last few years. The algorithms performance is sensitive to the size of the state space. Various branching time relations
on CTMCs have been been defined which allow for a state space reduction prior to model checking. In particular
bisimulation minimisation yields considerable reductions and time savings. Recently weighted lumpability (WL) has

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences