Skip to main navigation Skip to search Skip to main content

Algebraic state machines

  • University of Munich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

We introduce the concept of an algebraic state machine. This is a state transition machine all parts of that are described by algebraic and logical means. This way we base the description of state transition systems exclusively on the concept of algebraic specifications. Also the state of an algebraic state machine is represented by an algebra. In particular, we describe the state spaces of the state machine by algebraic techniques, and the state transitions by special axioms called transition rules. Then we show how known concepts from algebraic specifications can be used to provide a notion of parallel composition with asynchronous interaction for algebraic state machines. As example we introduce a notion of object-oriented component and show how algebraic state machines can formalize such components.

Original languageEnglish
Title of host publicationAlgebraic Methodology and Software Technology - 8th International Conference, AMAST 2000, Proceedings
EditorsTeodor Rus
PublisherSpringer Verlag
Pages89-118
Number of pages30
ISBN (Print)9783540454991
DOIs
StatePublished - 2000
Event8th International Conference on Algebraic Methodology and Software Technology, AMAST 2000 - Iowa City, United States
Duration: 20 May 200027 May 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1816
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Algebraic Methodology and Software Technology, AMAST 2000
Country/TerritoryUnited States
CityIowa City
Period20/05/0027/05/00

Fingerprint

Dive into the research topics of 'Algebraic state machines'. Together they form a unique fingerprint.

Cite this