scientific article; zbMATH DE number 1361128

zbMath0939.68081MaRDI QIDQ4270063

Prakash Panangaden, Vineet Gupta, Radha Jagadeesan, Josée Desharnais

Publication date: 20 December 1999

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

zbMATH Keywords

process algebrapartial labeled Markov chains

Mathematics Subject Classification ID

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

Related Items (45)

A metrized duality theorem for Markov processes ⋮ De Bakker-Zucker processes revisited ⋮ Recursively defined metric spaces without contraction ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Converging from branching to linear metrics on Markov chains ⋮ A pseudometric in supervisory control of probabilistic discrete event systems ⋮ Metrics for labelled Markov processes ⋮ A complete axiomatization of weighted branching bisimulation ⋮ On Equivalences, Metrics, and Polynomial Time ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Explainability of probabilistic bisimilarity distances for labelled Markov chains ⋮ Approximating labelled Markov processes ⋮ Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ On behavioural pseudometrics and closure ordinals ⋮ Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ Unnamed Item ⋮ A Behavioural Pseudometric based on λ–Bisimilarity ⋮ Differential privacy in probabilistic systems ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Bisimulation for Markov Decision Processes through Families of Functional Expressions ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ The probabilistic powerdomain for stably compact spaces ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Domain theory, testing and simulation for labelled Markov processes ⋮ A behavioural pseudometric for probabilistic transition systems ⋮ An introduction to metric semantics: Operational and denotational models for programming and specification languages ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ Measuring the confinement of probabilistic systems ⋮ Quantitative analysis of weighted transition systems ⋮ Bisimulation and cocongruence for probabilistic systems ⋮ A brief history of process algebra ⋮ Approximating and computing behavioural distances in probabilistic transition systems ⋮ On the metric-based approximate minimization of Markov chains ⋮ Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity ⋮ Unnamed Item ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata ⋮ A Formal Framework for User Centric Control of Probabilistic Multi-agent Cyber-Physical Systems ⋮ Extending set functors to generalised metric spaces ⋮ Bisimulation metrics and norms for real-weighted automata ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ \(\pi\)-calculus with noisy channels ⋮ On finite-state approximants for probabilistic computation tree logic ⋮ Labelled Markov Processes as Generalised Stochastic Relations

This page was built for publication: