Formal techniques for performance analysis: blending SAN and PEPA
From MaRDI portal
Publication:877152
DOI10.1007/S00165-006-0011-6zbMATH Open1111.68014OpenAlexW1979306756MaRDI QIDQ877152FDOQ877152
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
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)
Cites Work
- Title not available (Why is that?)
- A Compositional Approach to Performance Modelling
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Title not available (Why is that?)
- Efficient descriptor-vector multiplications in stochastic automata networks
- Product form solution for a class of PEPA models
- Title not available (Why is that?)
- Product form in networks of queues with batch arrivals and batch services
- The numerical solution of stochastic automata networks
- Closed queueing networks with batch services
- Aggregation of stochastic automata networks with replicas
- Stochastic concurrent constraint programming and differential equations
- Efficient computation and representation of large reachability sets for composed automata
- Iterative methods based on splittings for stochastic automata networks
- A Function-Equivalent Components Based Simplification Technique for PEPA Models
- Integrating synchronization with priority into a Kronecker representation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coordination Models and Languages
Cited In (4)
Uses Software
Recommendations
This page was built for publication: Formal techniques for performance analysis: blending SAN and PEPA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877152)