Exact performance equivalence: An equivalence relation for stochastic automata

DOI10.1016/S0304-3975(98)00169-8zbMath0913.68141MaRDI QIDQ1285589

Peter Buchholz

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

stochastic automataquantitative analysisqualitative analysisequivalence of stochastic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Categorical foundations for randomly timed automata, Weighted Bisimulation in Linear Algebraic Form, Reverse bisimilarity vs. forward bisimilarity, Lowerbounds for Bisimulation by Partition Refinement, Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses, Bisimulation relations for weighted automata, Lumpable continuous-time stochastic automata networks., Symbolic computation of differential equivalences

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• Testing equivalences for processes
• A Theory of Communicating Sequential Processes
• Composite performance and dependability analysis
• Exact and ordinary lumpability in finite Markov chains
• A notion of equivalence for stochastic Petri nets
• A Compositional Approach to Performance Modelling
• Dynamic Inference
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item