2013/08/27 by Corina Ĉırstea, Corina Cirstea
Computer Science · Mathematics · #Algebra over a field #Algorithm #Bisimulation #Branching (polymer chemistry) #Coalgebra #Computation #Computer science #Discrete mathematics #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematics #Measure (data warehouse) #Probabilistic logic #Pure mathematics #State (computer science) #Statistics #Type (biology) #cs.LO
paper · pdf · doi:10.4204/eptcs.126.2
published as EPTCS 126, 2013, pp. 11-27 · In Proceedings FICS 2013, arXiv:1308.5896
openalex publication_date 2013/08/27 · arxiv created 2013/09/04 · arxiv updated 2013/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in such a coalgebra. By moving away from a boolean universe of truth values, our approach can measure the extent to which a state in a system with branching is able to exhibit a particular linear-time behaviour. This instantiates to measuring the probability of a specific behaviour occurring in a probabilistic system, or measuring the minimal cost of exhibiting a specific behaviour in the case of weighted computations.