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.

[1]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[2]  Marino Miculan,et al.  Structural operational semantics for non-deterministic processes with quantitative aspects , 2014, Theor. Comput. Sci..

[3]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[4]  Marco Peressotti,et al.  A Uniform Framework for Timed Automata , 2016, CONCUR.

[5]  Alexandra Silva,et al.  An Algebra for Kripke Polynomial Coalgebras , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[6]  Diego Latella,et al.  A uniform definition of stochastic process calculi , 2013, CSUR.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Vladimiro Sassone,et al.  Structural operational semantics for stochastic and weighted transition systems , 2013, Inf. Comput..

[9]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[10]  Marino Miculan,et al.  On the Bisimulation Hierarchy of State-to-Function Transition Systems , 2016, ICTCS.

[11]  LoretiMichele,et al.  A uniform definition of stochastic process calculi , 2013 .

[12]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[13]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[14]  Corina Cîrstea,et al.  Modular construction of complete coalgebraic logics , 2007, Theor. Comput. Sci..

[15]  Erik P. de Vink,et al.  A Definition Scheme for Quantitative Bisimulation , 2015, QAPL.

[16]  Marino Miculan,et al.  GSOS for non-deterministic processes with quantitative aspects , 2014, QAPL.

[17]  Marco Bernardo,et al.  Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems , 2016, ICTCS.

[18]  Rocco De Nicola,et al.  A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences , 2013, Inf. Comput..

[19]  Marino Miculan,et al.  Behavioural equivalences for coalgebras with unobservable moves , 2014, J. Log. Algebraic Methods Program..

[20]  Ana Sokolova,et al.  Exemplaric Expressivity of Modal Logics , 2010, J. Log. Comput..

[21]  Marino Miculan,et al.  Weak bisimulations for labelled transition systems weighted over semirings , 2013, ArXiv.

[22]  Erik P. de Vink,et al.  Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically , 2015, Log. Methods Comput. Sci..

[23]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[24]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[25]  Sam Staton.  Relating Coalgebraic Notions of Bisimulation , 2009, CALCO.

[26]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..