Catalogue


Network algebra /
Gheorghe Ștefănescu.
imprint
London ; New York : Springer, c2000.
description
xv, 400 p. : ill. ; 24 cm.
ISBN
185233195X (alk. paper)
format(s)
Book
Holdings
More Details
imprint
London ; New York : Springer, c2000.
isbn
185233195X (alk. paper)
catalogue key
4252591
 
Includes bibliographical references and index.
A Look Inside
Summaries
Unpaid Annotation
Network Algebra is devoted to the algebraic study of networks and their behavior. The term 'network' is used in a broad sense within this book and two radically different interpretations of this notion of networks are studied. The book 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, leading to a sound understanding of the algebraic fundamentals of the network theory.
Main Description
Network algebra considers the algebraic study of networks and their behavior. It approaches the models in a sharp and simple manner. This book takes an integrated view of a broad range of applications, varying from concrete hardware-oriented models to high-level software-oriented models.
Bowker Data Service Summary
Devoted to a general, algebraic study of networks and their behaviour, this volume presents a range of apparently unrelated models that have appeared in the body of literature dealing with the subject.
Main Description
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 nets or 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.
Table of Contents
Preface
An introduction to Network Algebra
Brief overview of the key resultsp. 3
Network Algebra and its applicationsp. 17
Relations, flownomials, and abstract networks
Networks modulo graph isomorphismp. 57
Algebraic models for branching constantsp. 91
Network behaviourp. 123
Elgot theoriesp. 147
Kleene theoriesp. 169
Algebraic theory of special networks
Flowchart schemesp. 197
Automatap. 223
Process algebrap. 249
Data-flow networksp. 275
Petri netsp. 305
Towards an algebraic theory for software components
Mixed Network Algebrap. 323
Related calculi, closing remarksp. 351
Equivalent BNA presentation (LR-flows)p. 353
Lifting BNA from connections to networksp. 359
Demonic relation operatorsp. 362
Generating congruencesp. 368
Automata, complementsp. 369
Data-flow networks; checking NA axiomsp. 371
Axiomatizing mixed relationsp. 373
Discats as sysecatsp. 375
Decomposing morphisms in discatsp. 377
Plans as free discatsp. 379
Bibliographyp. 381
List of tablesp. 391
List of figuresp. 393
Indexp. 395
Table of Contents provided by Blackwell. All Rights Reserved.

This information is provided by a service that aggregates data from review sources and other sources that are often consulted by libraries, and readers. The University does not edit this information and merely includes it as a convenience for users. It does not warrant that reviews are accurate. As with any review users should approach reviews critically and where deemed necessary should consult multiple review sources. Any concerns or questions about particular reviews should be directed to the reviewer and/or publisher.

  link to old catalogue

Report a problem