Descripción del título
Network Algebra / by Gheorg...
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
Monografía
monografia Rebiun21829505 https://catalogo.rebiun.org/rebiun/record/Rebiun21829505 m o d cr mnu---uuaaa 121227s2000 enk ob 001 0 eng 9781447104797 electronic bk.) 144710479X electronic bk.) 9781852331955 185233195X UPVA 996968088703706 AU@ eng pn AU@ OCLCO OCLCQ GW5XE COO OCLCQ YDX UAB OCLCF OCLCQ PBKS bicssc COM051300 bisacsh Stefanescu, Gheorghe Network Algebra by Gheorghe Stefanescu London Springer London 2000 London London Springer London 1 online resource (xvi, 400 pages) 1 online resource (xvi, 400 pages) Text txt rdacontent computer c rdamedia online resource cr rdacarrier Discrete Mathematics and Theoretical Computer Science Includes bibliographical references (pages 381-390) and index An Introduction to Network Algebra: Short Overview on the key results. Network Algebra and its applications -- Relations, Flownomials and Abstract Networks: Networks modulo graph isomorphism. Algebraic models for branching constants. Network behaviour. Elgot theories. Kleene theories -- Algebraic Theory of Special Networks: Flowchart schemes. Automata. Process Algebra. Dataflow Networks. Petri Nets -- Towards an Algebraic Theory for Software Components: Mixed Network Algebra. Related Calculi, Closing Remarks -- Appendices -- Bibliography -- List of Tables -- List of Figures -- Index 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 Mathematics Computer Communication Networks Algorithms Telecommunication Algorithms. Mathematics. Telecommunication. Electronic books Print version 9781852331955 Discrete mathematics and theoretical computer science