Transition systems without transitions

  • Authors:
  • Andrzej M. Borzyszkowski;Philippe Darondeau

  • Affiliations:
  • Institute of Computer Science, Gdańsk Branch, Polish Acadamy of Science, Abrahama 18, 81-825 Sopot, Poland;IRISA, campus de Beaulieu, F35042 Rennes Cedex, France

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 5.23

Visualization

Abstract

We study the problem of embedding partial 2-structures into set 2-structures such that the target structure is full and forward closed and it is minimal w.r.t, these properties.Ehrenfeucht and Rozenberg introduced the notion of partial 2-structures--an abstract form of transition systems--and studied the problem of representing them as partial set 2-structures--directed graphs made of sets and their ordered symmetric differences. They constructed a representation and gave the conditions under which the representation is an isomorphism.We propose an alternative representation of partial 2-structures by partial set 2-structures which are complete graphs, hence their transitions may be left implicit, yielding a static representation of dynamic systems.