Name
Abstract | ||
|---|---|---|
In the theory of transition systems it is of great interest to determine whether two given states are bisimilar. Transition systems can be modelled as coalgebras, which gives us a general framework to analyse behavioural equivalence of systems with various branching types. In classical bisimulation theory, the concept of attacker-defender games provides us with an alternative way to define bisimulation. In such games the attacker tries to make a move that cannot be imitated by the defender. If the defender is always able to match the move of the attacker, we can infer that both initial states are behaviourally equivalent. Viewing behavioural equivalence as a game is quite intuitive and also has a clear relation to modal logics. To our knowledge, there has been only little work on generalizing such bisimulation games to the level of coalgebra. In this paper, we are proposing games for coalgebras in Set and show that they faithfully characterize behavioural equivalence. We require a condition on functors which already appeared similarly in work on coalgebraic modal logics. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Logic in Computer Science | Discrete mathematics,Algebra,Bisimulation,Mathematics |
DocType | Volume | Citations |
Journal | abs/1705.10165 | 0 |
PageRank | References | Authors |
0.34 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Barbara König | 1 | 78 | 8.13 |
| Christina Mika | 2 | 0 | 0.68 |