Tile Transition Systems as Structured Coalgebras

  • Authors:

  • Andrea Corradini;Reiko Heckel;Ugo Montanari

  • Affiliations:

  • -;-;-

  • Venue:
  • FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side effects which are endowed with operations of parallel and sequential composition and synchronization. Their models can be described as monoidal double categories. Coalgebras can be considered, in a suitable mathematical setting, as dual to algebras. They can be used as models of dynamical systems with hidden states in order to study concepts of observational equivalence and bisimilarity in a more general setting. In order to capture in the coalgebraic presentation the algebraic structure given by the composition operations on tiles, coalgebras have to be endowed with an algebraic structure as well. This leads to the concept of structured coalgebras, i.e., coalgebras for an endofunctor on a category of algebras. However, structured coalgebras are more restrictive than tile models. Those models which can be presented as structured coalgebras are characterized by the so-called horizontal decomposition property, which, intuitively, requires that the behavior is compositional in the sense that all transitions from complex states can be derived by composing transitions out of component states.