Port automata and the algebra of concurrent porcesses (Q791319)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3850477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Port automata and the algebra of concurrent porcesses |
scientific article; zbMATH DE number 3850477 |
Statements
Port automata and the algebra of concurrent porcesses (English)
0 references
1983
0 references
A relatively simple and straightforward model of communicating processes is presented. The model parallels that of \textit{G. Milne} and \textit{R. Milner} [J. Assoc. Comput. Mach. 26, 302-321 (1979; Zbl 0395.68030)], but here a process (i.e. the unit of concurrent processing) is modelled by a port automaton, a certain type of nondeterministic sequential machine. To define and to compute the response of the port automaton, a theory of greatest fixpoints is applied. It is shown that using an automata- theoretic approach to concurrency, an algebraic notion of process may be defined without requiring ordered sets.
0 references
communicating processes
0 references
concurrent processing
0 references
port automaton
0 references
nondeterministic sequential machine
0 references
greatest fixpoints
0 references
concurrency
0 references
0.7930816411972046
0 references
0.7885286211967468
0 references
0.7848616242408752
0 references
