Partitioning of perfect synchroneous reactive specifications to distributed processors using μ-charts.

Saved in:

Bibliographic Details
Title:	Partitioning of perfect synchroneous reactive specifications to distributed processors using μ-charts.
Authors:	Scholz, Peter¹ peter.scholz@fh-landshut.de
Source:	Software & Systems Modeling. Apr2006, Vol. 5 Issue 1, p13-25. 13p. 7 Diagrams, 1 Chart.
Subjects:	Statecharts (Computer science), Distributed computing, Structured techniques of electronic data processing, Computer science, Computer programming
Abstract:	In this contribution, it is shown that perfect synchroneous specifications can be partitioned to and implemented on a distributed processor network. To this end, we introduce a lean visual formalism, called μ-charts, that is similar to the specification language Statecharts. This formalism consists of fewer syntactic constructs than Statecharts. Further syntax like hierarchical decomposition can be derived by means of syntactic abbreviation. μ-charts' semantics is based on the assumption of perfect synchrony. This paper is one of several contributions in this context; it gives a formal background and concentrates on the question how to use perfect synchroneous, state-based description techniques as a basis for distributed implementations. The main contribution presented in this article is that the (formal and compositional) semantics of a perfect synchroneous specification is preserved when it is partitioned and implemented on distributed processors. We prove a theorem which guarantees that the communication flow between distributed parts of a perfect synchroneous specification stabilizes in a fixed point, i.e.$ terminates, independently of the processor speeds. [ABSTRACT FROM AUTHOR]
	Copyright of Software & Systems Modeling is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In this contribution, it is shown that perfect synchroneous specifications can be partitioned to and implemented on a distributed processor network. To this end, we introduce a lean visual formalism, called μ-charts, that is similar to the specification language Statecharts. This formalism consists of fewer syntactic constructs than Statecharts. Further syntax like hierarchical decomposition can be derived by means of syntactic abbreviation. μ-charts' semantics is based on the assumption of perfect synchrony. This paper is one of several contributions in this context; it gives a formal background and concentrates on the question how to use perfect synchroneous, state-based description techniques as a basis for distributed implementations. The main contribution presented in this article is that the (formal and compositional) semantics of a perfect synchroneous specification is preserved when it is partitioned and implemented on distributed processors. We prove a theorem which guarantees that the communication flow between distributed parts of a perfect synchroneous specification stabilizes in a fixed point, i.e.$ terminates, independently of the processor speeds. [ABSTRACT FROM AUTHOR]
ISSN:	16191366
DOI:	10.1007/s10270-005-0094-1