Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation
نویسندگان
چکیده
Weighted labelled transition systems (WLTSs) are an established (meta-)model aiming to provide general results and tools for a wide range of systems such as non-deterministic, stochastic, and probabilistic systems. In order to encompass processes combining several quantitative aspects, extensions of the WLTS framework have been further proposed, state-to-function transition systems (FuTSs) and uniform labelled transition systems (ULTraSs) being two prominent examples. In this paper we show that this hierarchy of meta-models collapses when studied under the lens of bisimulation-coherent encodings. Taking advantage of these reductions, we derive a fully abstract Hennessy-Milner-style logic for FuTSs, i.e., which characterizes quantitative bisimilarity, from a fully-abstract logic for WLTSs.
منابع مشابه
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...
متن کامل“ A Domain Equation for
Abramsky’s seminal article [3] is devoted to a detailed concurrency-theoretic application of the author’s “theory of domains in logical form” programme [4]. One of the main results in [3] is a logical characterization of the finitary bisimulation (cf. Theorem 5.8 on p. 191). (See [5] for a behavioural characterization of the finitary bisimulation.) More precisely, Abramsky shows that two proces...
متن کاملLogical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions
In recent years the study of probabilistic transition systems has shifted to transition relations over distributions to allow for a smooth adaptation of the standard non-probabilistic apparatus. In this paper we study transition relations over probability distributions in a setting with internal actions. We provide new logics that characterize probabilistic strong, weak and branching bisimulati...
متن کاملLogical characterizations of simulation and bisimulation for fuzzy transition systems
Simulations and bisimulations are known to be useful for abstracting and comparing formal systems, and they have recently been introduced into fuzzy systems. In this study, we provide sound and complete logical characterizations for simulation and bisimulation, which are defined over fuzzy labeled transition systems via two variants of the Hennessy-Milner Logic. The logic for characterizing fuz...
متن کاملOn the trade-off between labels and weights in quantitative bisimulation
Reductions for transition systems have been recently introduced as a uniform and principled method for comparing the expressiveness of system models with respect to a range of properties, especially bisimulations. In this paper we study the expressiveness (w.r.t. bisimulations) of models for quantitative computations such as weighted labelled transition systems (WLTSs), uniform labelled transit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.07181 شماره
صفحات -
تاریخ انتشار 2017