Network Algebra by Gheorghe Stefanescu

Network Algebra by Gheorghe Stefanescu

Network Algebra considers the algebraic study of networks and their behaviour. It contains general results on the algebraic theory of networks, recent results on the algebraic theory of models for parallel programs, as well as results on the algebraic theory of classical control structures. The results are presented in a unified framework of the calculus of flownomials, leading to a sound understanding of the algebraic fundamentals of the network theory. The term 'network' is used in a broad sense within this book, as consisting of a collection of interconnecting cells, and two radically different specific interpretations of this notion of networks are studied. One interpretation is additive, when only one cell is active at a given time - this covers the classical models of control specified by finite automata or flowchart schemes. The second interpretation is multiplicative, where each cell is always active, covering models for parallel computation such as Petri netsor dataflow networks. More advanced settings, mixing the two interpretations are included as well. Network Algebra will be of interest to anyone interested in network theory or its applications and provides them with the results needed to put their work on a firm basis. Graduate students will also find the material within this book useful for their studies.

Interesting exercises and problems accompany most of sectionsAlso some open questions related to this subject are present. (Daniela Marinescu, zbMATH 0956.68002, 2022)

SKU	Unavailable
ISBN 13	9781852331955
ISBN 10	185233195X
Title	Network Algebra
Author	Gheorghe Stefanescu
Series	Discrete Mathematics And Theoretical Computer Science
Condition	Unavailable
Binding Type	Paperback
Publisher	Springer London Ltd
Year published	2000-04-12
Number of pages	402
Cover note	Book picture is for illustrative purposes only, actual binding, cover or edition may vary.