Network algebra
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Network design and communication in computer systems (68M10) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
This book is structured in 4 Parts,12 chapters. Part I is an introduction to Network Algebra and is formed by an overview of the key results and by the Chapter 1, Network Algebra and its applications. This chapter is an introduction to the calculus of flownomials. The most important parts of this book are Part II (Chapters 2-6) which contains results on general, abstract networks, and Part III (Chapter 7-11) dedicated to particular networks. In Chapter 2 is introduced the BNA structure (or aá-flow) and is proved the soundness and correctness of BNA axioms for networks modulo graph isomorphism. Chapter 3 presents algebraic models for branching constants to the BNA signature and corresponding weak axioms. Also the main results of Chapter 2 are extended to networks with branching constants. The network behavior is the subject of the Chapter 4. So the strong and enzymatic axioms for branching constants are introduced, which it allows to duplicate or remove network cells. In Chapters 5 and 6 are presented Elgot theories, Milner theories, Kleene theories and Park theories. For this theories some structural theorems are presented. Part II ends with a table containing the basic axioms used in the calculus of flownomials. Part III presents the algebraic theory of special networks. Flow-chart scheme is the subject of the Chapter 7. The main result here is the soundness and completeness of Floyd-Hoare logic, when it is interpreted in Cazanescu - Ungureanu theories. Also a few interesting duality results between flow-chart and circuit are presented. The fundamental results on finite automata are presented in the Chapter 8. So the connections between nondeterministic and deterministic automata, minimization and relation to regular expressions are presented. The subject of the Chapter 9 is a short presentation of process algebra, in its ACP versions. Chapter 10 is dedicated to data-flow network. Are presented synchronous and asynchronous networks, axiomation asynchronous deterministic and nondeterministic networks. The Chapter 11 is a brief presentation of Petri nets and the connection between Perti net languages and concurrent regular expressions. The Part IV is formed by a single chapter, Chapter 12, which describes the mixed network algebra models, obtained mixing network algebra models for control space and time. In the end there is an Appendix containing technical proofs. Interesting exercises and problems accompany most of sections. Also some open questions related to this subject are present.
- scientific article; zbMATH DE number 3869234
- Algebraic structures for dynamic networks
- scientific article; zbMATH DE number 2110613
- scientific article; zbMATH DE number 4047616
- Mixed network calculus
- Network algebra in Java
- scientific article; zbMATH DE number 49666
- An algorithmic toolbox for network calculus
- scientific article; zbMATH DE number 3982236
- An algebra of hybrid systems
- Structural and behavioural equivalences of networks
- Dynamic connectors for concurrency
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
- A string diagrammatic axiomatisation of finite-state automata
- Algebraic structures for dynamic networks
- The refinement calculus of reactive systems
- The uniformity principle on traced monoidal categories
- scientific article; zbMATH DE number 3869234 (Why is no real title available?)
- scientific article; zbMATH DE number 5150814 (Why is no real title available?)
- Associative digital network theory. An associative algebra approach to logic, arithmetic and state machines
- Algebraic Methods Applied to Network Reliability Problems
- scientific article; zbMATH DE number 177839 (Why is no real title available?)
- Network algebra for asynchronous dataflow∗
- Reaction and control I. Mixing additive and multiplicative network algebras
- Algebraic Theory of Automata Networks
- Feedback, trace and fixed-point semantics
- scientific article; zbMATH DE number 2110613 (Why is no real title available?)
- Categorical rewriting of term-like structures
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Verification techniques for a network algebra
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- On the geometry and algebra of networks with state
- On Compiling Structured Interactive Programs with Registers and Voices
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams
- The algebra of stream processing functions
- Causal semantics for the algebra of connectors
- Network rewriting utility description
- Asymptotic identity in min-plus algebra: a report on CPNS
- The calculus of signal flow diagrams. I: Linear relations on streams.
- A complete theory of sequential digital circuits: denotational, operational and algebraic semantics
- A taxonomy of categories for relations
- Elgot categories and abacus programs
- A categorical model for the geometry of interaction
- A basic algebra of stateless connectors
This page was built for publication: Network algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4492940)
