Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
type: Item
instance of: scholarly article
title: Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
zbMATH Open document ID: 1390.68371
author: Giacomo Alzetta
author: Andrea Marin
author: Carla Piazza
author: Sabina Rossi
published in: Information and Computation
publication date: 2018-05-30T00:00:00Z
full work available at URL: http://hdl.handle.net/11390/1142576
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 6876406
zbMATH Keywords: stochastic automata
zbMATH Keywords: quantitative analysis
zbMATH Keywords: behavioural equivalences
zbMATH Keywords: product-forms stochastic models
describes a project that uses: SPADES
describes a project that uses: ipc
MaRDI profile type: Publication
OpenAlex ID: W2804498827
cites work: Comparative branching-time semantics for Markov chains
cites work: Analysis of queueing networks with blocking
cites work: Queueing Networks
cites work: Lumping and reversed processes in cooperating automata
cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
cites work: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
cites work: Exact and ordinary lumpability in finite Markov chains
cites work: Exact performance equivalence: An equivalence relation for stochastic automata
cites work: Flow equivalence and stochastic equivalence in G-networks
cites work: Turning back time in Markovian process algebra.
cites work: Interactive Markov chains. And the quest for quantified quality
cites work: Process algebra for performance evaluation
cites work: Q3855869
cites work: Q4094202
cites work: Bisimulation through probabilistic testing
cites work: Aggregation and truncation of reversible Markov chains modulo state renaming
cites work: On the relations between Markov chain lumpability and reversibility
cites work: Quantitative Analysis of Concurrent Reversible Computations
cites work: Three Partition Refinement Algorithms
cites work: Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
cites work: Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
cites work: Simple O(m logn) Time Markov Chain Lumping
DOI: 10.1016/J.IC.2018.04.002
description: scientific article; zbMATH DE number 6876406