Filippo Bonchi ; Ana Sokolova ; Valeria Vignudelli - The Theory of Traces for Systems with Nondeterminism, Probability, and Termination

lmcs:6261 - Logical Methods in Computer Science, June 17, 2022, Volume 18, Issue 2 - https://doi.org/10.46298/lmcs-18(2:21)2022
The Theory of Traces for Systems with Nondeterminism, Probability, and TerminationArticle

Authors: Filippo Bonchi ; Ana Sokolova ; Valeria Vignudelli

    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.


    Volume: Volume 18, Issue 2
    Published on: June 17, 2022
    Accepted on: December 3, 2021
    Submitted on: April 2, 2020
    Keywords: Computer Science - Logic in Computer Science
    Funding:
      Source : OpenAIRE Graph
    • Coinduction for Verification and Certification; Funder: European Commission; Code: 678157
    • Community of mathematics and fundamental computer science in Lyon; Funder: French National Research Agency (ANR); Code: ANR-10-LABX-0070
    • PROJET AVENIR LYON SAINT-ETIENNE; Funder: French National Research Agency (ANR); Code: ANR-11-IDEX-0007
    • Quantitative Reasoning Methods for Probabilistic Logics; Funder: French National Research Agency (ANR); Code: ANR-20-CE48-0005

    Consultation statistics

    This page has been seen 1961 times.
    This article's PDF has been downloaded 584 times.