scientific article

zbMath1062.68081MaRDI QIDQ2760248

Wang Yi, Kim Guldstrand Larsen, Bengt Jonsson

Publication date: 2001

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

zbMATH Keywords

process algebraparallelismprobabilistic bisimulationprobabilistic transition system

Mathematics Subject Classification ID

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

Related Items (44)

A General Framework for Probabilistic Characterizing Formulae ⋮ A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Specification, testing and implementation relations for symbolic-probabilistic systems ⋮ The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator ⋮ A general SOS theory for the specification of probabilistic transition systems ⋮ Model Checking Probabilistic Systems ⋮ Switched PIOA: parallel composition via distributed scheduling ⋮ Fair testing ⋮ SOS specifications for uniformly continuous operators ⋮ A Formalized Hierarchy of Probabilistic System Types ⋮ Algebraic theory of probabilistic processes. ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems ⋮ Value-passing CCS with noisy channels ⋮ Consistency and refinement for interval Markov chains ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ From Gene Regulation to Stochastic Fusion ⋮ A framework for analyzing probabilistic protocols and its application to the partial secrets exchange ⋮ Modular construction of complete coalgebraic logics ⋮ Differential privacy in probabilistic systems ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ Linear Structures for Concurrency in Probabilistic Programming Languages ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ A hierarchy of probabilistic system types ⋮ Constraint Markov chains ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ Measuring the confinement of probabilistic systems ⋮ Unnamed Item ⋮ Making random choices invisible to the scheduler ⋮ A modular approach to defining and characterising notions of simulation ⋮ Unnamed Item ⋮ Tempus fugit: How to plug it ⋮ Bialgebraic methods and modal logic in structural operational semantics ⋮ Bisimulations Meet PCTL Equivalences for Probabilistic Automata ⋮ CoLoSS: The Coalgebraic Logic Satisfiability Solver ⋮ GSOS for probabilistic transition systems ⋮ Compositional weak metrics for group key update ⋮ Remarks on Testing Probabilistic Processes ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ Notes on Generative Probabilistic Bisimulation ⋮ Coalgebraic Modal Logic Beyond Sets ⋮ On Probabilistic Techniques for Data Flow Analysis ⋮ Modular Games for Coalgebraic Fixed Point Logics ⋮ Process-algebraic approaches for multi-agent systems: an overview

This page was built for publication: