Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes

DOI10.1016/j.tcs.2010.01.027zbMath1334.68156OpenAlexW47800957MaRDI QIDQ974113

Simone Tini

Publication date: 27 May 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.027

zbMATH Keywords

probabilistic processesnon-expansiveness\(\varepsilon\)-bisimulationbehavioral distancetransition rule formats

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

A general SOS theory for the specification of probabilistic transition systems, Approximate analyzing of labeled transition systems, SOS specifications for uniformly continuous operators, A process algebra framework for multi-scale modelling of biological systems, Back to the format: a survey on SOS for probabilistic processes, Value-passing CCS with noisy channels, Unnamed Item, Compositional bisimulation metric reasoning with Probabilistic Process Calculi, Lattice-valued simulations for quantitative transition systems, Logical characterization of branching metrics for nondeterministic probabilistic transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Structural operational semantics for weak bisimulations
• Higher-level synchronising devices in Meije-SCCS
• Bisimulation through probabilistic testing
• A behavioural pseudometric for probabilistic transition systems
• Discrete time generative-reactive probabilistic processes with different advancing speeds
• The meaning of negative premises in transition system specifications. II
• A structural approach to operational semantics
• Reactive, generative, and stratified models of probabilistic processes
• Axiomatizing probabilistic processes: ACP with generative probabilities
• Rooted branching bisimulation as a congruence
• Approximating and computing behavioural distances in probabilistic transition systems
• GSOS for probabilistic transition systems
• Probabilistic bisimulation as a congruence
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• The meaning of negative premises in transition system specifications
• Testing preorders for probabilistic processes
• Approximation Metrics for Discrete and Continuous Systems
• Structural Operational Semantics for Stochastic Process Calculi
• Automata, Languages and Programming
• Non Expansive ε-Bisimulations
• Foundations of Software Science and Computational Structures
• Processes, Terms and Cycles: Steps on the Road to Infinity
• CONCUR 2003 - Concurrency Theory
• Foundations of Security Analysis and Design II