From Branching to Linear Time, Coalgebraically
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 boolea...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2013-08-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1309.0891v1 |
| id |
doaj-f67b250eec7745d1bdfb68640a62f5b9 |
|---|---|
| record_format |
Article |
| spelling |
doaj-f67b250eec7745d1bdfb68640a62f5b92020-11-24T22:38:18ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802013-08-01126Proc. FICS 2013112710.4204/EPTCS.126.2From Branching to Linear Time, CoalgebraicallyCorina CirsteaWe 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.http://arxiv.org/pdf/1309.0891v1 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Corina Cirstea |
| spellingShingle |
Corina Cirstea From Branching to Linear Time, Coalgebraically Electronic Proceedings in Theoretical Computer Science |
| author_facet |
Corina Cirstea |
| author_sort |
Corina Cirstea |
| title |
From Branching to Linear Time, Coalgebraically |
| title_short |
From Branching to Linear Time, Coalgebraically |
| title_full |
From Branching to Linear Time, Coalgebraically |
| title_fullStr |
From Branching to Linear Time, Coalgebraically |
| title_full_unstemmed |
From Branching to Linear Time, Coalgebraically |
| title_sort |
from branching to linear time, coalgebraically |
| publisher |
Open Publishing Association |
| series |
Electronic Proceedings in Theoretical Computer Science |
| issn |
2075-2180 |
| publishDate |
2013-08-01 |
| description |
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. |
| url |
http://arxiv.org/pdf/1309.0891v1 |
| work_keys_str_mv |
AT corinacirstea frombranchingtolineartimecoalgebraically |
| _version_ |
1725713797757272064 |