Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC

DOI10.33048/SEMI.2018.15.144zbMATH Open1414.60062arXiv1702.07478OpenAlexW3015864650MaRDI QIDQ2633503FDOQ2633503

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

Publication date: 9 May 2019

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

Abstract: We propose an extension with immediate multiactions of discrete time stochastic Petri Box Calculus (dtsPBC), presented by I.V. Tarasyuk. The resulting algebra dtsiPBC is a discrete time analogue of stochastic Petri Box Calculus (sPBC) with immediate multiactions, designed by H. Maci`a, V. Valero et al. within a continuous time domain. The step operational semantics is constructed via labeled probabilistic transition systems. The denotational semantics is based on labeled discrete time stochastic Petri nets with immediate transitions. To evaluate performance, the corresponding semi-Markov chains are analyzed. We define step stochastic bisimulation equivalence of expressions that is applied to reduce their transition systems and underlying semi-Markov chains while preserving the functionality and performance characteristics. We explain how this equivalence can be used to simplify performance analysis of the algebraic processes. In a case study, a method of modeling, performance evaluation and behaviour reduction for concurrent systems is outlined and applied to the shared memory system.

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

zbMATH Keywords

performance evaluationdiscrete timereductionPetri box calculusstochastic equivalencestochastic process algebrasemi-Markov chainimmediate multiactionoperational and denotational semantics

Mathematics Subject Classification ID

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

Cites Work

• Non-interleaving semantics for mobile processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theoretical Aspects of Computing - ICTAC 2004
• Bisimulation through probabilistic testing
• A calculus of mobile processes. I
• Three Partition Refinement Algorithms
• Exact and ordinary lumpability in finite Markov chains
• A Compositional Approach to Performance Modelling
• Algebra of communicating processes with abstraction
• Deciding bisimilarity and similarity for probabilistic processes.
• Title not available (Why is that?)
• The Quest for Minimal Quotients for Probabilistic Automata
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
• Optimal state-space lumping in Markov chains
• Petri net algebra
• Reactive, generative, and stratified models of probabilistic processes
• Stochastic process reduction for performance evaluation in dtsiPBC
• Iteration in discrete time stochastic Petri box calculus
• Performance analysis of concurrent systems in algebra dtsiPBC
• Introduction to Generalized Stochastic Petri Nets
• Title not available (Why is that?)
• Discrete Time Stochastic Petri Nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A refined view of the box algebra
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Title not available (Why is that?)
• Language-based performance prediction for distributed and mobile systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deciding true concurrency equivalences on safe, finite nets
• Parametric probabilistic transition systems for system design and analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
• A notion of equivalence for stochastic Petri nets
• Analysis of discrete‐time stochastic petri nets
• Reconciling real and stochastic time: the need for probabilistic refinement
• Performance Evaluation of Distributed Systems Based on a Discrete Real- and Stochastic-Time Process Algebra
• Extending Timed Process Algebra with Discrete Stochastic Time
• A congruence relation for sPBC
• Equivalence relations for modular performance evaluation in dtsPBC
• A Survey of Markovian Behavioral Equivalences
• Iterative Decomposition and Aggregation of Labeled GSPNs
• Validation of Stochastic Systems

Cited In (5)

• Performance preserving equivalence for stochastic process algebra dtsdPBC
• Title not available (Why is that?)
• Equivalence relations for modular performance evaluation in dtsPBC
• Performance evaluation in stochastic process algebra dtsdPBC
• Discrete time stochastic and deterministic Petri box calculus dtsdPBC

Uses Software

• PEPA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633503)