scientific article; zbMATH DE number 1759621

zbMath0999.68146MaRDI QIDQ4536612

Oleg Sokolsky, Anna Philippou, Insup Lee

Publication date: 25 June 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (38)

Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey ⋮ Deciding probabilistic automata weak bisimulation: theory and practice ⋮ A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Model independent approach to probabilistic models ⋮ Resources in process algebra ⋮ Comparative branching-time semantics for Markov chains ⋮ Model Checking Linear-Time Properties of Probabilistic Systems ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ Probabilistic bisimulation for realistic schedulers ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ Weak bisimulation for probabilistic timed automata ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Finite axiomatization for symbolic probabilistic \(\pi \)-calculus ⋮ Exploring probabilistic bisimulations. I ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Stuttering for abstract probabilistic automata ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ On the Semantics of Markov Automata ⋮ Branching Bisimulation Congruence for Probabilistic Systems ⋮ Relating strong behavioral equivalences for processes with nondeterminism and probabilities ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ On metrics for probabilistic systems: definitions and algorithms ⋮ Branching bisimulation for probabilistic systems: characteristics and decidability ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ Measuring the confinement of probabilistic systems ⋮ Unnamed Item ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ A probabilistic calculus of cyber-physical systems ⋮ Bisimulations Meet PCTL Equivalences for Probabilistic Automata ⋮ Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations ⋮ Probabilistic weak simulation is decidable in polynomial time ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity ⋮ Remarks on Testing Probabilistic Processes ⋮ A Family of Resource-Bound Real-Time Process Algebras

This page was built for publication: