Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
From MaRDI portal
Publication:2633503
performance evaluationdiscrete timereductionPetri box calculusstochastic equivalencestochastic process algebrasemi-Markov chainimmediate multiactionoperational and denotational semantics
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)
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.
Recommendations
- Performance analysis of concurrent systems in algebra dtsiPBC
- Stochastic process reduction for performance evaluation in dtsiPBC
- scientific article; zbMATH DE number 6708299
- Equivalence relations for modular performance evaluation in dtsPBC
- Modeling and analysis of the performance of parallel processes in the algebra dtsPBC
Cites work
- scientific article; zbMATH DE number 1822433 (Why is no real title available?)
- scientific article; zbMATH DE number 4035108 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- scientific article; zbMATH DE number 1927574 (Why is no real title available?)
- scientific article; zbMATH DE number 1786472 (Why is no real title available?)
- scientific article; zbMATH DE number 1786473 (Why is no real title available?)
- scientific article; zbMATH DE number 1786475 (Why is no real title available?)
- scientific article; zbMATH DE number 1786481 (Why is no real title available?)
- scientific article; zbMATH DE number 2087800 (Why is no real title available?)
- scientific article; zbMATH DE number 1843158 (Why is no real title available?)
- scientific article; zbMATH DE number 1884417 (Why is no real title available?)
- scientific article; zbMATH DE number 2090712 (Why is no real title available?)
- scientific article; zbMATH DE number 763717 (Why is no real title available?)
- A Compositional Approach to Performance Modelling
- A calculus of mobile processes. I
- A congruence relation for sPBC
- 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
- A refined view of the box algebra
- A survey of Markovian behavioral equivalences
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Algebra of communicating processes with abstraction
- Analysis of discrete‐time stochastic petri nets
- Bisimulation through probabilistic testing
- Deciding bisimilarity and similarity for probabilistic processes.
- Deciding true concurrency equivalences on safe, finite nets
- Discrete Time Stochastic Petri Nets
- Equivalence relations for modular performance evaluation in dtsPBC
- Exact and ordinary lumpability in finite Markov chains
- Extending Timed Process Algebra with Discrete Stochastic Time
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Introduction to generalized stochastic Petri nets
- Iteration in discrete time stochastic Petri box calculus
- Iterative Decomposition and Aggregation of Labeled GSPNs
- Language-based performance prediction for distributed and mobile systems
- Non-interleaving semantics for mobile processes
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
- Optimal state-space lumping in Markov chains
- Parametric probabilistic transition systems for system design and analysis
- Performance analysis of concurrent systems in algebra dtsiPBC
- Performance evaluation of distributed systems based on a discrete real- and stochastic-time process algebra
- Petri net algebra
- Reactive, generative, and stratified models of probabilistic processes
- Reconciling real and stochastic time: the need for probabilistic refinement
- Stochastic Petri box calculus with discrete time
- Stochastic process reduction for performance evaluation in dtsiPBC
- The quest for minimal quotients for probabilistic automata
- Theoretical Aspects of Computing - ICTAC 2004
- Three Partition Refinement Algorithms
- Validation of Stochastic Systems
- sPBC: a Markovian extension of Petri box calculus with immediate multiactions
Cited in
(11)- scientific article; zbMATH DE number 6708299 (Why is no real title available?)
- Performance preserving equivalence for stochastic process algebra dtsdPBC
- Performance analysis of concurrent systems in algebra dtsiPBC
- Equivalence relations for modular performance evaluation in dtsPBC
- sPBC: a Markovian extension of Petri box calculus with immediate multiactions
- Stochastic Petri box calculus with discrete time
- Performance evaluation of the generalized shared memory system in dtsPBC
- Performance evaluation in stochastic process algebra dtsdPBC
- Discrete time stochastic and deterministic Petri box calculus dtsdPBC
- A congruence relation for sPBC
- Stochastic process reduction for performance evaluation in dtsiPBC
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)
