Using 'parallel automaton' as a single notation to specify, design and control small computer based systems

Abstract

We present in this paper a methodology how to use 'Parallel Automaton' to set up the requirements, to specifi and to execute small Computer Based Systems (CBS). A Parallel Automaton' is an extended form of the Mealy Machine. It handles a finite set of events (or variable conditions or clock conditions) which can occur in parallel, and performs a finite set of actions which can be done in parallel. In the 'Parallel Automaton' there is no concept of "global state" as in the Mealy Machine. Instead, to each action and each event, is associated a '$private state " representing their occurrence in the application. Nevertheless, the number of event/sactions private states is also3nite. This single notation ('Parallel Automaton' with Private States) can be used to describe in the same way requirements and specifications. More than that, these two descriptions can be connected. The aims of the application can be described using a 'Parallel outputs. This 'Parallel Automaton' can then be refined and enhanced with intermediate conditions and actions to obtain detailed requirements. By successive refinements and enhancements, a suficiently detailed executable speclfication can be derivedWe present this methodology through a simple CBS example, for the requirements and the speclfications using the 'Parallel Automaton' notation. We then give an architecture o f a Virtual Machine that we have built to execute such a 'Parallel Automaton' on a network.

Execution platform for the Graphic Real-Time Design tool of Arts'Codes

“…Our execution platform is based on hierarchic parallel automata [9], which reacts in a double discrete time domain. The various automata (one automaton for each component) are concurrent but their reactions are ordered by (rigid) priorities (see section 3.4) and executed sequentially in a granule of time.…”

AMDA: Matching the Model-Driven-Architecture's Goals Using Extended Automata as a Common Model for Design and Execution

“…The dynamic behavior of the system objects is captured by the UML statechart diagrams, which are based on the notion of statecharts, introduced by David Harel [4]. Many different variants of Harel statecharts are known from the literature [5], and various formalizations were proposed, such as Extended Hierarchical Automata (EHA) [6] and the Parallel Automata [7].…”

Representación, interpretación y aprendizaje de flujos de trabajo basado en actividades para la estandarización de vías clínicas.

“…El problema del paralelismo ha sido tratado en muchos artículos [58,57,70,96] deniendo mejoras del Automata Finito Determinista para formar autómatas con capacidad de ejecutar actividades paralelas, sin aumentar la complejidad. N es un conjunto nito de nodos, Q ⊆ 2 N es un conjunto nito de estados, Σ es el alfabeto nito de entrada, γ : 2 N × (Σ ∪ {λ}) → 2 2 N ) es la función de transición de los nodos, δ : Q × (Σ ∪ {λ}) → 2 Q es la función de transición de estados, q 0 ∈ Q es estado inicial, F ⊆ N es el conjunto de nodos nales.…”