Statecharts via Process Algebra
Abstract
State charts is a visual language for specifying the behavior of reactive system. The language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded systems, precisely defining its semantics has proved extremely challenging. In this paper, a simple process algebra, called State charts Process Language (SPL), is presented, which is expressive enough for encoding State charts in a structure-preserving and semantics-preserving manner. It is established that the behavioral relation bisimulation, when applied to SPL, preserves State charts semantics.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1999
- Accession Number
- ADA371060
Entities
People
- Gerald Luettgen
- Michael Von Der Beeck
- Rance Cleaveland