scientific article; zbMATH DE number 1759621
From MaRDI portal
Publication:4536612
Recommendations
- Probabilistic weak bisimulation and axiomatization for probabilistic models
- Bisimulation and cocongruence for probabilistic systems
- Weak bisimulation for probabilistic timed automata
- Probabilistic bisimulation
- Branching bisimulation congruence for probabilistic systems
- Branching bisimulation congruence for probabilistic systems
- scientific article; zbMATH DE number 1754605
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Compositionality of approximate bisimulation for probabilistic systems
- Bisimulation for probabilistic transition systems: a coalgebraic approach
Cited in
(55)- Uniform random process model revisited
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- Measuring the confinement of probabilistic systems
- Comparative branching-time semantics for Markov chains
- Notes on generative probabilistic bisimulation
- Stuttering for abstract probabilistic automata
- Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
- A family of resource-bound real-time process algebras
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- Model independent approach to probabilistic models
- Probabilistic bisimulation as a congruence
- Group-by-group probabilistic bisimilarities and their logical characterizations
- Deciding probabilistic automata weak bisimulation: theory and practice
- Branching bisimulation congruence for probabilistic systems
- A probabilistic calculus of cyber-physical systems
- Probabilistic weak bisimulation and axiomatization for probabilistic models
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- scientific article; zbMATH DE number 1927573 (Why is no real title available?)
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Theoretical Aspects of Computing – ICTAC 2005
- Game characterization of probabilistic bisimilarity, and applications to pushdown automata
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
- On the semantics of Markov automata
- Probabilistic divide \& congruence: branching bisimilarity
- Branching bisimulation congruence for probabilistic systems
- Probabilistic weak simulation is decidable in polynomial time
- Reducing weak to strong bisimilarity in CCP
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
- Weak bisimulation for probabilistic timed automata
- Remarks on testing probabilistic processes
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Environmental bisimulations for probabilistic higher-order languages
- Formal verification of differential privacy for interactive systems (extended abstract)
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Model checking linear-time properties of probabilistic systems
- Resources in process algebra
- On metrics for probabilistic systems: definitions and algorithms
- Weak bisimulation is sound and complete for pCTL\(^*\)
- scientific article; zbMATH DE number 1418352 (Why is no real title available?)
- Deciding probabilistic automata weak bisimulation in polynomial time
- Bisimulations meet PCTL equivalences for probabilistic automata
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Computing maximal weak and other bisimulations
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Probabilistic bisimulation for realistic schedulers
- Probabilistic bisimulation for realistic schedulers
- On the Minimisation of Acyclic Models
- Exploring probabilistic bisimulations. I
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Polynomial time decision algorithms for probabilistic automata
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
- Axiomatizations for probabilistic finite-state behaviors
- On the probabilistic bisimulation spectrum with silent moves
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536612)
