Logical Characterization of Trace Metrics
نویسندگان
چکیده
In this paper we continue our research line on logical characterizations of behavioral metrics obtained from the definition of a metric over the set of logical properties of interest. This time we provide a characterization of both strong and weak trace metric on nondeterministic probabilistic processes, based on a minimal boolean logic L which we prove to be powerful enough to characterize strong and weak probabilistic trace equivalence. Moreover, we also prove that our characterization approach can be restated in terms of a more classic probabilistic L-model checking problem.
منابع مشابه
Linear and Branching Metrics for Quantitative Transition Systems
We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as real values in the interval [0,1]. Trace inclusion and equivalence give rise to asymmetrical and symmetrical linear distances, while simulation and bisimulation give rise to asymmetrical and symmetr...
متن کاملLogical Characterization of Bisimulation Metrics
Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic variant of the Hennessy-Milner logic. Our approach is based on the novel notions of mimicking formulae and distance between formulae. The former are a weak versi...
متن کاملLogic for Mobility: a Denotational Approach
We describe a logical framework based on a denotational characterization of mobile process semantics. The logic builds on a trace model that associates to processes the sequences of actions one can observe from their behaviors. The basic predicates of the logic are properties about such sets of sequences. In order to support the reasoning on branching structures, a notion of structured location...
متن کاملLink and Triadic Closure Delay: Temporal Metrics for Social Network Dynamics
Today, numerous models and metrics are available to capture and characterize static properties of online social networks. When it comes to understanding their dynamics and evolution, however, research offers little in terms of metrics or models. Current metrics are limited to logical time clocks, and unable to capture interactions with external factors that rely on physical time clocks. In this...
متن کاملRecurrent metrics in the geometry of second order differential equations
Given a pair (semispray $S$, metric $g$) on a tangent bundle, the family of nonlinear connections $N$ such that $g$ is recurrent with respect to $(S, N)$ with a fixed recurrent factor is determined by using the Obata tensors. In particular, we obtain a characterization for a pair $(N, g)$ to be recurrent as well as for the triple $(S, stackrel{c}{N}, g)$ where $stackrel{c}{N}$ is the canonical ...
متن کامل