Towards Performance Prediction of Compositional Models in Industrial GALS Designs
From MaRDI portal
Publication:3636862
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)
Recommendations
Cited in
(10)- Equivalence checking 40 years after: a review of bisimulation tools
- Deciding probabilistic automata weak bisimulation: theory and practice
- Branching bisimulation congruence for probabilistic systems
- A Tutorial on Interactive Markov Chains
- The how and why of interactive Markov chains
- Computer Aided Verification
- Efficient approximation of optimal control for continuous-time Markov games
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- Polynomial time decision algorithms for probabilistic automata
- Performance preserving equivalence for stochastic process algebra dtsdPBC
This page was built for publication: Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636862)