Transitions as interrupts: A new semantics for timed statecharts

  • Adriano Peron
  • Andrea Maggiolo-Schettini
Conference paper

DOI: 10.1007/3-540-57887-0_126

Part of the Lecture Notes in Computer Science book series (LNCS, volume 789)
Cite this paper as:
Peron A., Maggiolo-Schettini A. (1994) Transitions as interrupts: A new semantics for timed statecharts. In: Hagiya M., Mitchell J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg

Abstract

Statecharts is a visual formalism for the specification of reactive systems. The formalism has been endowed with a “step-semantics” which heavily bounds the complexity of the reaction in a step, does not model interrupts in a natural way and is not proper for investigating refinement. In this paper, a new model is proposed allowing to overcome the mentioned drawbacks. From a syntactic point of view statecharts are generalized by introducing real time features like delays and timeouts. Though occurrencies of actions are related to a dense time domain, the behaviour of statecharts is forced to be discrete. Classes of statecharts are investigated which intrinsically behave discretely.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Adriano Peron
    • 1
  • Andrea Maggiolo-Schettini
    • 2
  1. 1.Dipartimento di Matematica ed InformaticaUniversità di UdineUdineItaly
  2. 2.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations