| 书目名称 | Network Algebra | | 编辑 | Gheorghe Ştefănescu | | 视频video | | | 概述 | APPROACHES THE MODELS IN A SHARP AND SIMPLE MANNER * INTEGRATED VIEW OF A BROAD RANGE OF APPLICATIONS VARYING FROM CONCRETE HARDWARE-ORIENTED MODELS TO HIGH-LEVEL SOFTWARE-ORIENTED MODELS. | | 丛书名称 | Discrete Mathematics and Theoretical Computer Science | | 图书封面 |  | | 描述 | Network Algebraconsiders the algebraic study of networks and theirbehaviour.It contains general results on the algebraic theory ofnetworks, recent results on the algebraic theory of models for parallelprograms, as well as results on the algebraic theory of classical controlstructures.The results are presented in a unified framework of thecalculus of flownomials, leading to a sound understanding of the algebraicfundamentals of the network theory.The term ‘network‘ is used in a broad sense within this book, asconsisting of a collection of interconnecting cells, and two radicallydifferent specific interpretations of this notion of networks are studied.One interpretation is additive, when only one cell is active at a giventime - this covers the classical models of control specified by finiteautomata or flowchart schemes.The second interpretation ismultiplicative, where each cell is always active, covering models forparallel computation such as Petri netsor dataflow networks. Moreadvanced settings, mixing the two interpretations are included as well.Network Algebrawill be of interest to anyone interested in networktheory or its applications and provides them with the results needed topu | | 出版日期 | Textbook 2000 | | 关键词 | Concurrency and Control; Feedback; Network Algebra; algebra; calculus; parallel computation | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4471-0479-7 | | isbn_softcover | 978-1-85233-195-5 | | isbn_ebook | 978-1-4471-0479-7 | | copyright | Springer-Verlag London 2000 |
The information of publication is updating
|
|
发表于 2025-3-21 19:29:36
