On behavioural pseudometrics and closure ordinals

DOI10.1016/j.ipl.2012.06.019zbMath1248.68359OpenAlexW2010466545MaRDI QIDQ456100

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

zbMATH Keywords

formal semanticsconcurrencybehavioural pseudometricclosure ordinalleast fixed point

Mathematics Subject Classification ID

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

Related Items (9)

SOS specifications for uniformly continuous operators ⋮ Unnamed Item ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Unnamed Item ⋮ A probabilistic calculus of cyber-physical systems ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation through probabilistic testing
• A lattice-theoretical fixpoint theorem and its applications
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Game Refinement Relations and Metrics
• Approximate reasoning for real-time probabilistic processes
• Automata, Languages and Programming

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