
doi: 10.1007/bfb0030335
A multiprocessor system can be considered as a collection of finite automata which communicate over channels or shared memory units. The behaviour of such a system can be described by a semilanguage. This approach allows to define a numberical measure for the concurrency of multiprocessor systems and of distributed systems. This measure is characterized algebraically and the reconfiguration problem asking for an algorithm to construct an l-processor system which is equivalent to a given n-processor system is solved in the paper.
nondeterminism, distributed systems, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), multiprocessor systems, Petri nets, concurrency, multiprocessor system, finite automata, Models of computation (Turing machines, etc.), semilanguage, Theory of operating systems
nondeterminism, distributed systems, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), multiprocessor systems, Petri nets, concurrency, multiprocessor system, finite automata, Models of computation (Turing machines, etc.), semilanguage, Theory of operating systems
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
