Network Algebra

Softcover Nachdruck of the original 1. Auflage 2000
ISBN: 978-1-85233-195-5
Verlag: Springer

Buch, Englisch, 402 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 633 g

Reihe: Discrete Mathematics and Theoretical Computer Science

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.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Stefanescu, Gheorghe

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik Mathematik Mathematik Interdisziplinär Computeralgebra
• Mathematik | Informatik Mathematik Algebra Homologische Algebra
• Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung

Inhaltsverzeichnis

I. An introduction to Network Algebra.- Brief overview of the key results.- 1. Network Algebra and its applications.- II. Relations, flownomials, and abstract networks.- 2. Networks modulo graph isomorphism.- 3. Algebraic models for branching constants.- 4. Network behaviour.- 5. Elgot theories.- 6. Kleene theories.- 7. Flowchart schemes.- 8. Automata.- 9. Process algebra.- 10. Data-flow networks.- 11. Petri nets.- IV. Towards an algebraic theory for software components.- 12. Mixed Network Algebra.- Related calculi, closing remarks.- Appendix B: Lifting BNA from connections to networks.- Appendix C: Demonic relation operators.- Appendix D. Generating congruences.- Appendix E: Automata, complements.- Appendix F: Data-flow networks; checking NA axioms.- Appendix G: Axiomatizing mixed relations.- Appendix H: Discats as sysecats.- Appendix I: Decomposing morphisms in discats.- Appendix J: Plans as free discats.- List of tables.- List of figures.