A complete inference system for probabilistic infinite trace equivalence
A complete inference system for probabilistic infinite trace equivalence
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.
Coalgebra, convex sets, infinite trace, logic, semantics
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Moss, Lawrence S.
09a39a02-a64b-494b-a03b-fad3be84c4ba
Noquez, Victoria
968e2719-7255-414a-94e7-f73c9d41f607
Schmid, Todd
8ff4661a-60a6-43d8-a6b0-9f5514708df9
Silva, Alexandra
f5d6815a-8c49-40bb-ac75-dec333153dfe
Sokolova, Ana
dc4a1e4d-0c01-46dc-94c6-5ad8d4404417
3 February 2025
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Moss, Lawrence S.
09a39a02-a64b-494b-a03b-fad3be84c4ba
Noquez, Victoria
968e2719-7255-414a-94e7-f73c9d41f607
Schmid, Todd
8ff4661a-60a6-43d8-a6b0-9f5514708df9
Silva, Alexandra
f5d6815a-8c49-40bb-ac75-dec333153dfe
Sokolova, Ana
dc4a1e4d-0c01-46dc-94c6-5ad8d4404417
Cirstea, Corina, Moss, Lawrence S., Noquez, Victoria, Schmid, Todd, Silva, Alexandra and Sokolova, Ana
(2025)
A complete inference system for probabilistic infinite trace equivalence.
Endrullis, Jorg and Schmitz, Sylvain
(eds.)
In 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025).
vol. 326,
Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
23 pp
.
(doi:10.4230/LIPIcs.CSL.2025.30).
Record type:
Conference or Workshop Item
(Paper)
Abstract
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.
Text
LIPIcs.CSL.2025.30
- Version of Record
More information
Accepted/In Press date: 24 November 2024
Published date: 3 February 2025
Keywords:
Coalgebra, convex sets, infinite trace, logic, semantics
Identifiers
Local EPrints ID: 497006
URI: http://eprints.soton.ac.uk/id/eprint/497006
ISSN: 1868-8969
PURE UUID: d9a32da6-5993-4ae5-a972-6aa05400d957
Catalogue record
Date deposited: 09 Jan 2025 18:03
Last modified: 16 Dec 2025 02:39
Export record
Altmetrics
Contributors
Author:
Corina Cirstea
Author:
Lawrence S. Moss
Author:
Victoria Noquez
Author:
Todd Schmid
Author:
Alexandra Silva
Author:
Ana Sokolova
Editor:
Jorg Endrullis
Editor:
Sylvain Schmitz
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics