SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes

We propose a method for the decomposition of modal formulae on processes with nondeterminism and probability with respect to Structural Operational Semantics. The purpose is to reduce the satisfaction problem of a formula for a process to verifying whether its subprocesses satisfy certain formulae obtained from the decomposition. To deal with the probabilistic behavior of processes, and thus with the decomposition of formulae characterizing it, we introduce a SOS-like machinery allowing for the specification of the behavior of open distribution terms. By our decomposition, we obtain (pre)congruence formats for probabilistic bisimilarity, ready similarity and similarity.

[1]  James Worrell,et al.  An Algorithm for Quantitative Verification of Probabilistic Transition Systems , 2001, CONCUR.

[2]  Simone Tini,et al.  Modal Decomposition on Nondeterministic Probabilistic Processes , 2016, CONCUR.

[3]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[4]  Yuxin Deng,et al.  Characterising Probabilistic Processes Logically - (Extended Abstract) , 2010, LPAR.

[5]  Simone Tini,et al.  Probabilistic bisimulation as a congruence , 2009, TOCL.

[6]  Erik P. de Vink,et al.  Rooted branching bisimulation as a congruence for probabilistic transition systems , 2015, QAPL.

[7]  Simone Tini,et al.  Logical Characterization of Trace Metrics , 2017, QAPL@ETAPS.

[8]  Rob J. van Glabbeek,et al.  The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[9]  Roberto Segala,et al.  Logical Characterizations of Bisimulations for Discrete Probabilistic Systems , 2007, FoSSaCS.

[10]  Rocco De Nicola,et al.  Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes , 2012, FoSSaCS.

[11]  Bas Luttik,et al.  Divide and Congruence III: Stability & Divergence , 2017, CONCUR.

[12]  Wan Fokkink,et al.  Compositionality of Hennessy-Milner logic by structural operational semantics , 2006, Theor. Comput. Sci..

[13]  Simone Tini,et al.  Fixed-point Characterization of Compositionality Properties of Probabilistic Processes Combinators , 2014, EXPRESS/SOS.

[14]  Simone Tini,et al.  SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators , 2015, CONCUR.

[15]  Yuxin Deng,et al.  Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation , 2011, ArXiv.

[16]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[17]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[18]  Radha Jagadeesan,et al.  Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..

[19]  Tom Chothia,et al.  Metrics for Action-labelled Quantitative Transition Systems , 2006, QAPL.

[20]  Wan Fokkink,et al.  Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity , 2016, Inf. Comput..

[21]  Matias David Lee,et al.  Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules , 2014, FoSSaCS.

[22]  Suzana Andova,et al.  Branching bisimulation for probabilistic systems: Characteristics and decidability , 2005, Theor. Comput. Sci..

[23]  Wan Fokkink,et al.  Precongruence formats for decorated trace semantics , 2002, TOCL.

[24]  Wan Fokkink,et al.  Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity , 2012, Inf. Comput..

[25]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[26]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.

[27]  Erik P. de Vink,et al.  Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions , 2016, MFCS.

[28]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[29]  Kim G. Larsen,et al.  Compositional Metric Reasoning with Probabilistic Process Calculi , 2015, FoSSaCS.

[30]  Roberto Segala,et al.  A Compositional Trace-Based Semantics for Probabilistic Automata , 1995, CONCUR.

[31]  Simone Tini,et al.  Logical Characterization of Bisimulation Metrics , 2016, QAPL.

[32]  Wan Fokkink,et al.  Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics , 2012, CONCUR.

[33]  Wan Fokkink,et al.  Divide and Congruence II: Delay and Weak Bisimilarity , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[34]  Matias David Lee,et al.  Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation , 2012, FoSSaCS.

[35]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

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

[37]  Radha Jagadeesan,et al.  The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[38]  Carroll Morgan,et al.  Characterising Testing Preorders for Finite Probabilistic Processes , 2007, LICS.

[39]  Simone Tini,et al.  SOS specifications for uniformly continuous operators , 2018, J. Comput. Syst. Sci..