A Complete Inference System for Probabilistic Infinite Trace Equivalence

Authors

Corina Cîrstea, University of SouthamptonFollow
Lawrence S. Moss, Indiana University - BloomingtonFollow
Victoria Noquez, Saint Mary's College of CaliforniaFollow
Todd SchmidFollow
Ana Sokolova, Universitat SalzburgFollow
Alexandra Silva, Cornell UniversityFollow

Publication Date

Winter 2-3-2025

Conference/Sponsorship/Institution

https://csl2025.github.io/

Description

We present the first sound and complete axiomatization of infinite trace semantics for generative probabilistic transition systems. Our approach is categorical, and we build on recent results on proper functors over convex sets. At the core of our proof is a characterization of infinite traces as the final coalgebra of a functor over convex algebras. Somewhat surprisingly, our axiomatization of infinite trace semantics coincides with that of finite trace semantics, even though the techniques used in the completeness proof are significantly different.

Type

Conference Paper

Department

Computer Science

Link to published version

https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.30

Recommended Citation

Cîrstea, Corina; Moss, Lawrence S.; Noquez, Victoria; Schmid, Todd; Sokolova, Ana; and Silva, Alexandra, "A Complete Inference System for Probabilistic Infinite Trace Equivalence" (2025). Faculty Conference Papers and Presentations. 92.
https://digitalcommons.bucknell.edu/fac_conf/92