scientific article; zbMATH DE number 1759621

zbMATH Open0999.68146MaRDI QIDQ4536612FDOQ4536612

Oleg Sokolsky, Anna Philippou, Insup Lee

Publication date: 25 June 2002

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

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

Cited In (47)

Probabilistic divide \& congruence: branching bisimilarity
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Stuttering for abstract probabilistic automata
Branching bisimulation congruence for probabilistic systems
Sound approximate and asymptotic probabilistic bisimulations for PCTL
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
Title not available (Why is that?)
Model Checking Linear-Time Properties of Probabilistic Systems
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
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Deciding probabilistic automata weak bisimulation: theory and practice
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
Polynomial time decision algorithms for probabilistic automata
Measuring the confinement of probabilistic systems
Exploring probabilistic bisimulations. I
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
Probabilistic weak simulation is decidable in polynomial time
A probabilistic calculus of cyber-physical systems
On the Semantics of Markov Automata
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
Probabilistic Bisimulation for Realistic Schedulers
Bisimulation for probabilistic transition systems: A coalgebraic approach
Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
Environmental bisimulations for probabilistic higher-order languages
Probabilistic weak bisimulation and axiomatization for probabilistic models
Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
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
Comparative branching-time semantics for Markov chains
Computing Behavioral Relations for Probabilistic Concurrent Systems
A Family of Resource-Bound Real-Time Process Algebras
Theoretical Aspects of Computing – ICTAC 2005
Uniform random process model revisited
Branching Bisimulation Congruence for Probabilistic Systems
Resources in process algebra

   Recommendations

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)