Formal techniques for performance analysis: blending SAN and PEPA

DOI10.1007/S00165-006-0011-6zbMath1111.68014OpenAlexW1979306756MaRDI QIDQ877152

Jane Hillston, Leïla Kloul

Publication date: 19 April 2007

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-006-0011-6

Mathematics Subject Classification ID

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)

Related Items (2)

Analysing distributed internet worm attacks using continuous state-space approximation of process algebra models ⋮ Stochastic Modelling of Communication Protocols from Source Code

Uses Software

• PRISM
• MoDeST
• PEPS
• PEPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Product form in networks of queues with batch arrivals and batch services
• Closed queueing networks with batch services
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Iterative methods based on splittings for stochastic automata networks
• The numerical solution of stochastic automata networks
• Aggregation of stochastic automata networks with replicas
• Efficient computation and representation of large reachability sets for composed automata
• Stochastic Concurrent Constraint Programming and Differential Equations
• Efficient descriptor-vector multiplications in stochastic automata networks
• A Function-Equivalent Components Based Simplification Technique for PEPA Models
• Integrating synchronization with priority into a Kronecker representation
• Product form solution for a class of PEPA models
• A Compositional Approach to Performance Modelling
• Coordination Models and Languages

This page was built for publication: Formal techniques for performance analysis: blending SAN and PEPA