Performance preserving equivalence for stochastic process algebra dtsdPBC

DOI10.33048/SEMI.2023.20.039zbMATH Open1544.68107MaRDI QIDQ6587404

I. V. Tarasyuk

Publication date: 14 August 2024

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

zbMATH Keywords

performanceoperational semanticsMarkov chaindiscrete timedenotational semanticstransition systemquotientdtsd-boxstochastic bisimulationPetri-box calculusstochastic and deterministic delays

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) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Performance analysis of concurrent systems in algebra dtsiPBC
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
• Interactive Markov chains. And the quest for quantified quality
• 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 formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
• Petri net algebra
• \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
• Language-based performance prediction for distributed and mobile systems
• Reactive, generative, and stratified models of probabilistic processes
• Probability theory. Edited by K. A. Borovkov. Transl. from the Russian by O. Borovkova and P. S. Ruzankin
• Performance evaluation in stochastic process algebra dtsdPBC
• Proportional lumpability and proportional bisimilarity
• Proportional lumpability
• Discrete time stochastic and deterministic Petri box calculus dtsdPBC
• Non-bisimulation-based Markovian behavioral equivalences
• A congruence relation for sPBC
• Stochastic process reduction for performance evaluation in dtsiPBC
• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
• Modal logic characterization of Markovian testing and trace equivalences
• Iteration in discrete time stochastic Petri box calculus
• Equivalences for stochastic Petri nets and stochastic process algebra
• Efficient Modelling and Generation of Markov Automata
• Probability and Statistics with Reliability, Queuing and Computer Science Applications
• Introduction to Generalized Stochastic Petri Nets
• A Survey of Markovian Behavioral Equivalences
• Discrete Time Stochastic Petri Nets
• Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
• Rule-Based Modelling of Cellular Signalling
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• Three Partition Refinement Algorithms
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• Exact and ordinary lumpability in finite Markov chains
• Analysis of discrete‐time stochastic petri nets
• Introduction to Queueing Systems with Telecommunication Applications
• Introduction to Probability Models
• A refined view of the box algebra
• A notion of equivalence for stochastic Petri nets
• The Quest for Minimal Quotients for Probabilistic Automata
• A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Theoretical Aspects of Computing - ICTAC 2004
• Equivalence relations for modular performance evaluation in dtsPBC
• Probability-2
• Iterative Decomposition and Aggregation of Labeled GSPNs

This page was built for publication: Performance preserving equivalence for stochastic process algebra dtsdPBC

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