Formal techniques for performance analysis: blending SAN and PEPA
type: Item
instance of: scholarly article
title: Formal techniques for performance analysis: blending SAN and PEPA
zbMATH Open document ID: 1111.68014
author: Jane Hillston
author: Leïla Kloul
published in: Formal Aspects of Computing
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5145020
describes a project that uses: MoDeST
describes a project that uses: PRISM
describes a project that uses: PEPS
describes a project that uses: PEPA
MaRDI profile type: Publication
full work available at URL: s00165-006-0011-6
OpenAlex ID: W1979306756
cites work: Aggregation of stochastic automata networks with replicas
cites work: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
cites work: Efficient computation and representation of large reachability sets for composed automata
cites work: Stochastic concurrent constraint programming and differential equations
cites work: Iterative methods based on splittings for stochastic automata networks
cites work: Coordination Models and Languages
cites work: Integrating synchronization with priority into a Kronecker representation
cites work: Efficient descriptor-vector multiplications in stochastic automata networks
cites work: Q4738769
cites work: Q4936893
cites work: A Compositional Approach to Performance Modelling
cites work: Q5687213
cites work: Q4798038
cites work: A Function-Equivalent Components Based Simplification Technique for PEPA Models
cites work: Closed queueing networks with batch services
cites work: Product form in networks of queues with batch arrivals and batch services
cites work: Product form solution for a class of PEPA models
cites work: Q4738778
cites work: The numerical solution of stochastic automata networks
DOI: 10.1007/S00165-006-0011-6
description: scientific article; zbMATH DE number 5145020