Tile transition systems as structured coalgebras (Q4934317)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1390052
Language Label Description Also known as
default for all languages
No label defined
    English
    Tile transition systems as structured coalgebras
    scientific article; zbMATH DE number 1390052

      Statements

      0 references
      0 references
      0 references
      17 September 2000
      0 references
      concurrent systems
      0 references
      tile rewrite systems
      0 references
      observational equivalence
      0 references
      bisimilarity
      0 references
      structured coalgebras
      0 references
      tile models
      0 references
      horizontal decomposition property
      0 references
      Tile transition systems as structured coalgebras (English)
      0 references
      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 a more restricted notion than tile models, since they only allow to represent models where bisimilarity is a congruence. For tile models, this condition corresponds to functoriality of bisimilarity, which is ensured by the horizontal decomposition property. The authors believe that the coalgebraic presentation of monoidal tile rewrite systems can be a starting point for transferring to the coalgebraic setting concrete applications of tile logic to formalisms like concurrent or located CCS, \({\pi}\)-calculus, etc. For the entire collection see [Zbl 0921.00033].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references