Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

(In)finite Trace Equivalence of Probabilistic Transition Systems

Abstract : We show how finite and infinite trace semantics of generative probabilistic transition systems arises through a determinisation construction. This enables the use of bisimulations (up-to) to prove equivalence. In particular, it follows that trace equivalence for finite probabilistic transition systems is decidable. Further, the determinisation construction applies to both discrete and continuous probabilistic systems.
Document type :
Conference papers
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, February 21, 2019 - 3:41:00 PM
Last modification on : Sunday, June 26, 2022 - 2:27:44 AM
Long-term archiving on: : Wednesday, May 22, 2019 - 7:54:58 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Alexandre Goy, Jurriaan Rot. (In)finite Trace Equivalence of Probabilistic Transition Systems. 14th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2018, Thessaloniki, Greece. pp.100-121, ⟨10.1007/978-3-030-00389-0_7⟩. ⟨hal-02044641⟩



Record views


Files downloads