scientific article; zbMATH DE number 1482700
From MaRDI portal
Publication:4492940
zbMath0956.68002MaRDI QIDQ4492940
Publication date: 30 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
A Finite Axiomatisation of Finite-State Automata Using String Diagrams, Feedback, trace and fixed-point semantics, String diagram rewrite theory II: Rewriting with symmetric monoidal structure, A basic algebra of stateless connectors, The refinement calculus of reactive systems, Network rewriting utility description, Petri nets are dioids: a new algebraic foundation for non-deterministic net theory, A string diagrammatic axiomatisation of finite-state automata, On the geometry and algebra of networks with state, A Note on an Old-Fashioned Algebra for (Disconnected) Graphs, Categorical rewriting of term-like structures, On Compiling Structured Interactive Programs with Registers and Voices, The calculus of signal flow diagrams. I: Linear relations on streams., Causal semantics for the algebra of connectors, An algebra of hybrid systems, The Uniformity Principle on Traced Monoidal Categories, Dynamic connectors for concurrency, A categorical model for the geometry of interaction
Uses Software
