The Theory of Traces for Systems with Nondeterminism, Probability, and Termination

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction. We characterise and compare the resulting semantics to known definitions of trace equivalences appearing in the literature. Most of our results are based on the exciting interplay between monads and their presentations via algebraic theories.

[1]  Alexandra Silva,et al.  A coalgebraic view on decorated traces , 2016, Math. Struct. Comput. Sci..

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

[3]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

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

[5]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[6]  Lijun Zhang,et al.  Distribution-Based Bisimulation for Labelled Markov Processes , 2017, FORMATS.

[7]  Ohad Kammar,et al.  A convenient category for higher-order probability theory , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[8]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[9]  Alexandra Silva,et al.  Layer by layer - Combining Monads , 2017, ICTAC.

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

[11]  Ana Sokolova,et al.  Termination in Convex Sets of Distributions , 2017, CALCO.

[12]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[13]  Sebastian Junges,et al.  A Storm is Coming: A Modern Probabilistic Model Checker , 2017, CAV.

[14]  Lijun Zhang,et al.  When Equivalence and Bisimulation Join Forces in Probabilistic Automata , 2014, FM.

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

[16]  Ohad Kammar,et al.  Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[17]  Ernst-Erich Doberkat.  Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations , 2008, Inf. Comput..

[18]  Christel Baier,et al.  Principles of model checking , 2008 .

[19]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[20]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[21]  Wang Yi,et al.  Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.

[22]  Jurriaan Rot,et al.  Coalgebraic Trace Semantics via Forgetful Logics , 2015, FoSSaCS.

[23]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[24]  Sam Staton,et al.  Relating Coalgebraic Notions of Bisimulation , 2009, CALCO.

[25]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[27]  Bart Jacobs,et al.  Convexity, Duality and Effects , 2010, IFIP TCS.

[28]  M. H. Stone.  Postulates for the barycentric calculus , 1949 .

[29]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[30]  Carroll Morgan,et al.  Testing Finitary Probabilistic Processes , 2009, CONCUR.

[31]  Doina Precup,et al.  Equivalence Relations in Fully and Partially Observable Markov Decision Processes , 2009, IJCAI.

[32]  Ana Sokolova,et al.  Probabilistic systems coalgebraically: A survey , 2011, Theor. Comput. Sci..

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

[34]  Bartek Klin,et al.  Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..

[35]  Valentina Castiglioni,et al.  Trace and Testing Metrics on Nondeterministic Probabilistic Processes , 2018, EXPRESS/SOS.

[36]  Davide Sangiorgi,et al.  Enhancements of the bisimulation proof method , 2012, Advanced Topics in Bisimulation and Coinduction.

[37]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electronic Notes in Theoretical Computer Science.

[38]  Alexandra Silva,et al.  Generalizing the powerset construction, coalgebraically , 2010, FSTTCS.

[39]  Wang Yi,et al.  Testing and Refinement for Nondeterministic and Probabilistic Processes , 1994, FTRTFT.

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

[41]  Jurriaan Rot,et al.  A general account of coinduction up-to , 2016, Acta Informatica.

[42]  Holger Hermanns,et al.  Probabilistic Bisimulation: Naturally on Distributions , 2014, CONCUR.

[43]  Damien Pous,et al.  Checking NFA equivalence with bisimulations up to congruence , 2013, POPL.

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

[45]  Alexandra Silva,et al.  The Power of Convex Algebras , 2017, CONCUR.

[46]  Lijun Zhang,et al.  Probabilistic Logical Characterization , 2011, Inf. Comput..

[47]  R. V. Glabbeek.  CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .

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

[49]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[50]  Uwe Wolter,et al.  On Corelations, Cokernels, and Coequations , 2000, CMCS.

[51]  Zbigniew Semadeni,et al.  Monads and their Eilenberg-Moore algebras in functional analysis , 1973 .

[52]  F. Bartels.  On generalised coinduction and probabilistic specification formats : Distributive laws in coalgebraic modelling , 2004 .

[53]  Jean Goubault-Larrecq.  Prevision Domains and Convex Powercones , 2008, FoSSaCS.

[54]  Klaus Keimel,et al.  Mixed powerdomains for probability and nondeterminism , 2016, Log. Methods Comput. Sci..

[55]  Bart Jacobs,et al.  Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems , 2008, CMCS.

[56]  Damien Pous,et al.  Complete Lattices and Up-To Techniques , 2007, APLAS.

[57]  Gordon D. Plotkin,et al.  Combining Computational Effects: commutativity & sum , 2002, IFIP TCS.

[58]  Rocco De Nicola,et al.  Relating strong behavioral equivalences for processes with nondeterminism and probabilities , 2013, Theor. Comput. Sci..

[59]  Helmut Röhrl,et al.  Convexity theories IV. Klein-Hilbert parts in convex modules , 1995, Appl. Categorical Struct..

[60]  Joël Ouaknine,et al.  Convex Language Semantics for Nondeterministic Probabilistic Automata , 2018, ICTAC.