Dynamic connectors for concurrency
Theoretical Computer Science
Normal forms for algebras of connections
Theoretical Computer Science
Interactive Systems: From Folklore to Mathematics
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
A categorical model for the geometry of interaction
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Interactive Systems with Registers and Voices
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
Designing combinational circuits with list homomorphisms
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code
Applications of Graph Transformations with Industrial Relevance
On traced monoidal closed categories
Mathematical Structures in Computer Science
A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
From Geometry of Interaction to Denotational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Connector Colouring I: Synchronisation and Context Dependency
Electronic Notes in Theoretical Computer Science (ENTCS)
A finite complete set of equations generating graphs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
On compiling structured interactive programs with registers and voices
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Finite dimensional vector spaces are complete for traced symmetric monoidal categories
Pillars of computer science
Causal semantics for the algebra of connectors
Formal Methods in System Design
Implementation architecture and multithreaded runtime system of S-NET
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Control-Flow semantics for assembly-level data-flow graphs
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Transforming stream processing functions into state transition machines
SERA'04 Proceedings of the Second international conference on Software Engineering Research, Management and Applications
Interactive Systems with Registers and Voices
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Hi-index | 0.00 |
From the Publisher: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.