Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses

DOI10.1016/j.ic.2018.04.002zbMath1390.68371OpenAlexW2804498827MaRDI QIDQ1753998

Sabina Rossi, Giacomo Alzetta, Andrea Marin, Carla Piazza

Publication date: 30 May 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11390/1142576

zbMATH Keywords

behavioural equivalencesstochastic automataquantitative analysisproduct-forms stochastic models

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (7)

Reasoning about proportional lumpability ⋮ Proportional lumpability and proportional bisimilarity ⋮ Quantum encoding of dynamic directed graphs ⋮ Persistent Stochastic Non-Interference ⋮ \textit{D\_PSNI}: delimited persistent stochastic non-interference ⋮ Directed graph encoding in quantum computing supporting edge-failures ⋮ Parameter synthesis of polynomial dynamical systems

Uses Software

• SPADES
• ipc

Cites Work

• Unnamed Item
• Unnamed Item
• Lumping and reversed processes in cooperating automata
• Interactive Markov chains. And the quest for quantified quality
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Bisimulation through probabilistic testing
• Exact performance equivalence: An equivalence relation for stochastic automata
• Turning back time in Markovian process algebra.
• Aggregation and truncation of reversible Markov chains modulo state renaming
• Flow equivalence and stochastic equivalence in G-networks
• Comparative branching-time semantics for Markov chains
• On the relations between Markov chain lumpability and reversibility
• Quantitative Analysis of Concurrent Reversible Computations
• Queueing Networks
• Simple O(m logn) Time Markov Chain Lumping
• Three Partition Refinement Algorithms
• Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
• Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Exact and ordinary lumpability in finite Markov chains
• Analysis of queueing networks with blocking
• Process algebra for performance evaluation

This page was built for publication: Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses