A Compositional Approach to Performance Modelling
From MaRDI portal
Publication:5462953
DOI10.1017/CBO9780511569951zbMath1080.68003OpenAlexW4206542816MaRDI QIDQ5462953
Publication date: 29 July 2005
Full work available at URL: https://doi.org/10.1017/cbo9780511569951
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (92)
General patterns of interaction in stochastic fusion ⋮ Diagnosability of delay-deadline failures in fair real time discrete event models ⋮ Towards Bridging Time and Causal Reversibility ⋮ Performance investigation of an on‐line auction system ⋮ Reasoning about proportional lumpability ⋮ Lumpability for uncertain continuous-time Markov chains ⋮ Lumping and reversed processes in cooperating automata ⋮ Performance analysis of concurrent systems in algebra dtsiPBC ⋮ Proportional lumpability and proportional bisimilarity ⋮ Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC ⋮ Solving systems of bilinear equations for transition rate reconstruction ⋮ A Semantics for Every GSPN ⋮ Structural Operational Semantics for Weighted Transition Systems ⋮ Algorithmic product-form approximations of interacting stochastic models ⋮ Metrics for labelled Markov processes ⋮ Applying Reversibility Theory for the Performance Evaluation of Reversible Computations ⋮ Equivalences for fluid stochastic Petri nets ⋮ An algebra-based method to associate rewards with EMPA terms ⋮ On the relations between Markov chain lumpability and reversibility ⋮ Applying Mean-Field Approximation to Continuous Time Markov Chains ⋮ Formal techniques for performance analysis: blending SAN and PEPA ⋮ Unnamed Item ⋮ Quantitative Analysis of Communication Scenarios ⋮ Quantitative Analysis of Concurrent Reversible Computations ⋮ Differential Bisimulation for a Markovian Process Algebra ⋮ A notion of equivalence for stochastic Petri nets ⋮ Reverse bisimilarity vs. forward bisimilarity ⋮ Approximating labelled Markov processes ⋮ Rate lifting for stochastic process algebra -- exploiting structural properties ⋮ A Hemimetric Extension of Simulation for Semi-Markov Decision Processes ⋮ Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. ⋮ Turning back time in Markovian process algebra. ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Lumpability abstractions of rule-based systems ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Algebraic Reasoning About Timeliness ⋮ The compositional construction of Markov processes ⋮ Symbolic Semantics for Multiparty Interactions in the Link-Calculus ⋮ Computing branching distances with quantitative games ⋮ Unnamed Item ⋮ Discrete time stochastic and deterministic Petri box calculus dtsdPBC ⋮ On reaction-diffusion equations derived from a PEPA model ⋮ Assembly Code Analysis Using Stochastic Process Algebra ⋮ Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations ⋮ From Gene Regulation to Stochastic Fusion ⋮ Analysing distributed internet worm attacks using continuous state-space approximation of process algebra models ⋮ The compositional construction of Markov processes II ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ A theory of processes with durational actions ⋮ On the Semantics of Markov Automata ⋮ Persistent Stochastic Non-Interference ⋮ FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS ⋮ Algebraic approach for model decomposition: Application to fault detection and isolation in discrete-event systems ⋮ A compositional modelling and analysis framework for stochastic hybrid systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Stochastic Bigraphs ⋮ A congruence relation for sPBC ⋮ Bisimulation relations for weighted automata ⋮ Performability assessment by model checking of Markov reward models ⋮ A fluid analysis framework for a Markovian process algebra ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ Experience of building an architecture-based generator using GenVoca for distributed systems ⋮ An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA ⋮ A brief history of process algebra ⋮ Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems ⋮ The How and Why of Interactive Markov Chains ⋮ Model checking for a class of weighted automata ⋮ Structural Analysis for Stochastic Process Algebra Models ⋮ Concurrency, σ-Algebras, and Probabilistic Fairness ⋮ A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems ⋮ Categories of Timed Stochastic Relations ⋮ Book review of: D. Draheim, Semantics of the probabilistic typed lambda calculus. Markov chain semantics, termination behavior, and denotational semantics. ⋮ Fluid Analysis for a PEPA Model ⋮ Performance evaluation in stochastic process algebra dtsdPBC ⋮ Quantitative Abstractions for Collective Adaptive Systems ⋮ Process Algebra Modelling Styles for Biomolecular Processes ⋮ Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back ⋮ Formalisms for Specifying Markovian Population Models ⋮ Compositional Abstraction for Stochastic Systems ⋮ Exact performance equivalence: An equivalence relation for stochastic automata ⋮ Logical characterization of fluid equivalences ⋮ Semi-Product-Form Solution for PEPA Models with Functional Rates ⋮ On the computational power of BlenX ⋮ Quantitative semantics, topology, and possibility measures ⋮ Measure and probability for concurrency theorists ⋮ Separable equilibrium state probabilities via time reversal in Markovian process algebra ⋮ Stochastic Model Checking of the Stochastic Quality Calculus ⋮ It Sometimes Works: A Lifting Algorithm for Repair of Stochastic Process Algebra Models ⋮ PEPA Queues: Capturing Customer Behaviour in Queueing Networks ⋮ Automatic Moment-Closure Approximation of Spatially Distributed Collective Adaptive Systems ⋮ Separable solutions for Markov processes in random environments
Uses Software
This page was built for publication: A Compositional Approach to Performance Modelling
