Rational Operational Models

  • Authors:

  • Stefan Milius;Marcello M. Bonsangue;Robert S. R. Myers;Jurriaan Rot

  • Affiliations:

  • Lehrstuhl für Theoretische Informatik, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany;LIACS - Leiden University and Centrum Wiskunde en Informatica (CWI), The Netherlands;Institut für Theoretische Informatik, TU Braunschweig, Germany;LIACS - Leiden University and Centrum Wiskunde en Informatica (CWI), The Netherlands

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

GSOS is a specification format for well-behaved operations on transition systems. Aceto introduced a restriction of this format, called simple GSOS, which guarantees that the associated transition system is locally finite, i.e. every state has only finitely many different descendent states (i.e. states reachable by a sequence of transitions). The theory of coalgebras provides a framework for the uniform study of systems, including labelled transition systems but also, e.g. weighted transition systems and (non-)deterministic automata. In this context GSOS can be studied at the general level of distributive laws of syntax over behaviour. In the present paper we generalize Aceto@?s result to the setting of coalgebras by restricting abstract GSOS to bipointed specifications. We show that the operational model of a bipointed specification is locally finite, even for specifications with infinitely many operations which have finite dependency. As an example, we derive a concrete format for operations on regular languages and obtain for free that regular expressions have finitely many derivatives modulo the equations of join semilattices.