Towards Performance Prediction of Compositional Models in Industrial GALS Designs
DOI10.1007/978-3-642-02658-4_18zbMATH Open1242.68005OpenAlexW1580405793MaRDI QIDQ3636862FDOQ3636862
Authors: Nicolas Coste, Holger Hermanns, Etienne Lantreibecq, Wendelin Serwe
Publication date: 30 June 2009
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00381657/file/final_version.pdf
Recommendations
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)
Cited In (11)
- Computer Aided Verification
- Branching bisimulation congruence for probabilistic systems
- The how and why of interactive Markov chains
- Efficient approximation of optimal control for continuous-time Markov games
- Deciding probabilistic automata weak bisimulation: theory and practice
- Polynomial time decision algorithms for probabilistic automata
- Performance preserving equivalence for stochastic process algebra dtsdPBC
- Equivalence checking 40 years after: a review of bisimulation tools
- A Tutorial on Interactive Markov Chains
- Markov automata with multiple objectives
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
Uses Software
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)