Compositional separation of control flow and data flow
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4191145 (Why is no real title available?)
- scientific article; zbMATH DE number 4035108 (Why is no real title available?)
- scientific article; zbMATH DE number 1107620 (Why is no real title available?)
- scientific article; zbMATH DE number 5171028 (Why is no real title available?)
- scientific article; zbMATH DE number 3344105 (Why is no real title available?)
- A Compositional Framework for Passive Linear Networks
- A categorical approach to open and interconnected dynamical systems
- A compositional partial order semantics for Petri net components
- A diagrammatic algebra for program logics
- A mathematical theory of resources
- A modular formal semantics for Ptolemy
- A string diagrammatic axiomatisation of finite-state automata
- A survey of graphical languages for monoidal categories
- Algebraic approach to single-pushout graph transformation
- An introduction to string diagrams for computer scientists
- Categorical Data Structures for Technical Computing
- Categories for Software Engineering
- Categories in control
- Categories of nets
- Composition of interacting computations
- Compositional semantics for open Petri nets based on deterministic processes
- Computing with membranes
- Connector algebras for C/E and P/T nets' interactions
- Database queries and constraints via lifting problems
- Does My Service Have Partners?
- Double-pushout graph transformation revisited
- Enriching diagrams with algebraic operations
- Full abstraction for signal flow graphs
- Interacting quantum observables: categorical algebra and diagrammatics
- Introducing String Diagrams
- Multiparty session nets
- On the category of Petri net computations
- Open Petri nets
- Petri nets are monoids
- Petri nets based on Lawvere theories
- Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
- Programs as Diagrams
- Reo: a channel-based coordination model for component composition
- Rewriting modulo traced comonoid structure
- Soundness of workflow nets: classification, decidability, and analysis
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- String diagram rewrite theory III: Confluence with and without Frobenius
- String diagram rewrite theory. I: Rewriting with Frobenius structure
- String diagrammatic trace theory
- String diagrams for regular logic (extended abstract)
- The Esterel synchronous programming language: Design, semantics, implementation
- The Space and Motion of Communicating Agents
- The box algebra = Petri nets + process expressions
- The geometry of tensor calculus. I
- The origins of structural operational semantics
- Traced monoidal categories
- Whole-grain Petri nets and processes
This page was built for publication: Compositional separation of control flow and data flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268687)
