Towards Performance Prediction of Compositional Models in Industrial GALS Designs

DOI10.1007/978-3-642-02658-4_18MaRDI QIDQ3636862zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Computer Aided Verification
• Networks-on-Chips
• Theorem Proving in Higher Order Logics
• scientific article; zbMATH DE number 5046457
• The Chip Is the Network: Toward a Science of Network-on-Chip Design

Cited in

(11)

• Efficient approximation of optimal control for continuous-time Markov games
• Deciding probabilistic automata weak bisimulation: theory and practice
• A Tutorial on Interactive Markov Chains
• The how and why of interactive Markov chains
• Polynomial time decision algorithms for probabilistic automata
• Computer Aided Verification
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
• Equivalence checking 40 years after: a review of bisimulation tools
• Performance preserving equivalence for stochastic process algebra dtsdPBC
• MeGARA: menu-based game abstraction and abstraction refinement of Markov automata
• Branching bisimulation congruence for probabilistic systems

Describes a project that uses

Uses Software

• CADP
• LOTOS
• fc2tools

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)