On behavioural pseudometrics and closure ordinals

DOI10.1016/J.IPL.2012.06.019zbMATH Open1248.68359OpenAlexW2010466545MaRDI QIDQ456100FDOQ456100

Franck van Breugel

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.019

Recommendations

• A behavioural pseudometric based on \(\lambda\)-bisimilarity
• A behavioural pseudometric for probabilistic transition systems
• Behavioral metrics via functor lifting
• Automata, Languages and Programming
• CONCUR 2005 – Concurrency Theory

zbMATH Keywords

concurrencyformal semanticsbehavioural pseudometricclosure ordinalleast fixed point

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logical aspects of lattices and related structures (03G10)

Cites Work

• A lattice-theoretical fixpoint theorem and its applications
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Bisimulation through probabilistic testing
• Perturbations of positive semigroups with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Game Refinement Relations and Metrics
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Approximate reasoning for real-time probabilistic processes
• Automata, Languages and Programming

Cited In (10)

• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
• SOS specifications for uniformly continuous operators
• A probabilistic calculus of cyber-physical systems
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• Title not available (Why is that?)
• The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Title not available (Why is that?)
• Computing bisimilarity metrics for probabilistic timed automata

This page was built for publication: On behavioural pseudometrics and closure ordinals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456100)