Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains


Share/Save/Bookmark

Han, T. and Katoen, J.P. and Mereacre, A. (2008) Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains. In: Hybrid Systems: Computation and Control (HSCC), St. Louis, U.S. (pp. pp. 244-258).

[img] PDF
Restricted to UT campus only
: Request a copy
313kB
Abstract:This paper presents a compositional framework for the modeling of interactive continuous-time Markov chains with time-dependent rates, a subclass of communicating piecewise deterministic Markov processes. A poly-time algorithm is presented for computing the coarsest quotient under strong bisimulation for rate functions that are either piecewise uniform or (piecewise) polynomial. Strong as well as weak bisimulation are shown to be congruence relations for the
compositional framework, thus allowing component-wise minimization. In addition, a new characterization of transient probabilities in time-inhomogeneous
Markov chains with piecewise uniform rates is provided.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62226
Official URL:http://dx.doi.org/10.1007/978-3-540-78929-1_18
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 250918