Equivalence relations for modular performance evaluation in dtsPBC

DOI10.1017/S0960129513000029zbMath1342.68244MaRDI QIDQ5740349

Igor V. Tarasyuk

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC, Discrete time stochastic and deterministic Petri box calculus dtsdPBC, Performance evaluation in stochastic process algebra dtsdPBC

Cites Work

• Unnamed Item
• Optimal state-space lumping in Markov chains
• Algebra of communicating processes with abstraction
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Bisimulation through probabilistic testing
• A calculus of mobile processes. I
• A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
• Reactive, generative, and stratified models of probabilistic processes
• A Survey of Markovian Behavioral Equivalences
• Discrete Time Stochastic Petri Nets
• Three Partition Refinement Algorithms
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Analysis of discrete‐time stochastic petri nets
• Extending Timed Process Algebra with Discrete Stochastic Time