Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation (1704.07181v1)

Published 24 Apr 2017 in cs.LO

Abstract: 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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.