Performance preserving equivalence for stochastic process algebra dtsdPBC
From MaRDI portal
(Redirected from Publication:6587404)
denotational semanticsdiscrete timedtsd-boxMarkov chainoperational semanticsperformancePetri-box calculusquotientstochastic and deterministic delaysstochastic bisimulationtransition system
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)
Recommendations
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
- scientific article; zbMATH DE number 6708299
- Performance evaluation in stochastic process algebra dtsdPBC
- Equivalence relations for modular performance evaluation in dtsPBC
- Stochastic process reduction for performance evaluation in dtsiPBC
Cites work
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- 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 process algebraic approach to software architecture design
- A refined view of the box algebra
- A survey of Markovian behavioral equivalences
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Algebra of communicating processes with abstraction
- Analysis of discrete‐time stochastic petri nets
- Bisimulation of labelled state-to-function transition systems coalgebraically
- Bisimulation through probabilistic testing
- Discrete time stochastic and deterministic Petri box calculus dtsdPBC
- Discrete Time Stochastic Petri Nets
- Efficient modelling and generation of Markov automata
- Equivalence relations for modular performance evaluation in dtsPBC
- Equivalences for stochastic Petri nets and stochastic process algebra
- Exact and ordinary lumpability in finite Markov chains
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- scientific article; zbMATH DE number 1696462 (Why is no real title available?)
- scientific article; zbMATH DE number 1822433 (Why is no real title available?)
- scientific article; zbMATH DE number 5655798 (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 1755149 (Why is no real title available?)
- scientific article; zbMATH DE number 1786473 (Why is no real title available?)
- scientific article; zbMATH DE number 749809 (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 763717 (Why is no real title available?)
- Interactive Markov chains. And the quest for quantified quality
- Introduction to generalized stochastic Petri nets
- Introduction to Probability Models
- Introduction to queueing systems with telecommunication applications
- Iteration in discrete time stochastic Petri box calculus
- Iterative Decomposition and Aggregation of Labeled GSPNs
- Language-based performance prediction for distributed and mobile systems
- Modal logic characterization of Markovian testing and trace equivalences
- Non-bisimulation-based Markovian behavioral equivalences
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
- Optimal state-space lumping in Markov chains
- Performance analysis of concurrent systems in algebra dtsiPBC
- Performance evaluation in stochastic process algebra dtsdPBC
- Petri net algebra
- Probability and statistics with reliability, queuing, and computer science applications
- Probability theory. Edited by K. A. Borovkov. Transl. from the Russian by O. Borovkova and P. S. Ruzankin
- Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
- Probability-2
- Proportional lumpability
- Proportional lumpability and proportional bisimilarity
- Reactive, generative, and stratified models of probabilistic processes
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- Rule-Based Modelling of Cellular Signalling
- sPBC: a Markovian extension of Petri box calculus with immediate multiactions
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
- 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
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
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)
