Compositional SOS and beyond: a coalgebraic view of open systems

  • Authors:

  • Andrea Corradini;Reiko Heckel;Ugo Montanari

  • Affiliations:

  • Univ. degli Studi di Pisa, Pisa, Italy;Univ. Paderborn, Paderborn, Germany;Univ. degli Studi di Pisa, Pisa, Italy

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2002

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper we address the issue of providing a structured coalgebra presentation of transition systems with algebraic structure on states determined by an equational specification . More precisely, we aim at representing such systems as coalgebras for an endofunctor on the category of -algebras. The systems we consider are specified by using arbitrary SOS rules, which in general do not guarantee that bisimilarity is a congruence. We first show that the structured coalgebra representation works only for systems where transitions out of complex states can~be derived from transitions out of corresponding component states. This decomposition property of transitions indeed ensures that bisimilarity is a congruence. For a system not satisfying this requirement, next we propose a closure construction which adds context transitions, i.e., transitions that spontaneously embed a state into a bigger context or vice versa. The notion of bisimulation for the enriched system coincides with the notion of dynamic bisimilarity for the original one, i.e., with the coarsest bisimulation which is a congruence. This is sufficient to ensure that the structured coalgebra representation works for the systems obtained as result of the closure construction.