scientific article; zbMATH DE number 1759621

zbMATH Open0999.68146MaRDI QIDQ4536612FDOQ4536612

Authors: Anna Philippou, Insup Lee, Oleg Sokolsky 

Publication date: 25 June 2002

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (55)

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

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)