Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC

DOI10.33048/semi.2018.15.144zbMath1414.60062arXiv1702.07478OpenAlexW3015864650MaRDI QIDQ2633503

Hermenegilda Macià Soler, Igor V. Tarasyuk, Valentín Valero Ruiz

Publication date: 9 May 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.07478

zbMATH Keywords

reductionperformance evaluationdiscrete timePetri box calculusstochastic equivalencestochastic process algebrasemi-Markov chainimmediate multiactionoperational and denotational semantics

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov renewal processes, semi-Markov processes (60K15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Discrete time stochastic and deterministic Petri box calculus dtsdPBC ⋮ Performance evaluation in stochastic process algebra dtsdPBC

Uses Software

• PEPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance analysis of concurrent systems in algebra dtsiPBC
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
• Parametric probabilistic transition systems for system design and analysis
• 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
• Non-interleaving semantics for mobile processes
• Deciding true concurrency equivalences on safe, finite nets
• Petri net algebra
• Language-based performance prediction for distributed and mobile systems
• Reactive, generative, and stratified models of probabilistic processes
• Reconciling real and stochastic time: the need for probabilistic refinement
• Deciding bisimilarity and similarity for probabilistic processes.
• A congruence relation for sPBC
• Stochastic process reduction for performance evaluation in dtsiPBC
• Introduction to Generalized Stochastic Petri Nets
• A Survey of Markovian Behavioral Equivalences
• Discrete Time Stochastic Petri Nets
• Performance Evaluation of Distributed Systems Based on a Discrete Real- and Stochastic-Time Process Algebra
• Three Partition Refinement Algorithms
• Exact and ordinary lumpability in finite Markov chains
• Analysis of discrete‐time stochastic petri nets
• A refined view of the box algebra
• A notion of equivalence for stochastic Petri nets
• Validation of Stochastic Systems
• The Quest for Minimal Quotients for Probabilistic Automata
• A Compositional Approach to Performance Modelling
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Extending Timed Process Algebra with Discrete Stochastic Time
• Theoretical Aspects of Computing - ICTAC 2004
• Equivalence relations for modular performance evaluation in dtsPBC

This page was built for publication: Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC