On the public citation graph
Span(Graph): A categorical algebra of transition systems
0 signed · 90 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bf00872948openalex-snapshot
Higher categories, strings, cubes and simplex equations
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0018340openalex-snapshot
Category Theory and Computer Science
inferredcites →https://doi.org/10.1007/bfb0084235openalex-snapshot
An introduction to Tannaka duality and quantum groups
inferredcites →https://doi.org/10.1016/0022-4049(87)90121-6openalex-snapshot
Cartesian bicategories I
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/s0022-4049(96)00012-6openalex-snapshot
Bicategories of processes
inferredcites →https://doi.org/10.1017/cbo9780511608872openalex-snapshot
Categories and Computer Science
inferredcites →https://doi.org/10.1017/cbo9780511613104openalex-snapshot
Foundations of Quantum Group Theory
inferredcites →https://doi.org/10.1017/s0004972700003506openalex-snapshot
Data types in distributive categories
inferredcites →https://doi.org/10.1017/s0960129500000918openalex-snapshot
A note on recursive functions
inferredcites →https://doi.org/10.1017/s0960129500001468openalex-snapshot
An imperative language based on distributive categories
inferredcites →https://doi.org/10.1017/s0960129597002454openalex-snapshot
Minimal realization in bicategories of automata
inferredcites →https://doi.org/10.1051/ita/1987210200991openalex-snapshot
Notes on finite asynchronous automata
inferredcites →https://doi.org/10.1051/ita/1993270605031openalex-snapshot
An imperative language based on distributive categories II
inferredcites →https://doi.org/10.1112/s002460939729301xopenalex-snapshot
QUANTUM GROUPS (Graduate Texts in Mathematics 155)
inferredcites →https://doi.org/10.1515/9783110221848openalex-snapshot
Quantum Invariants of Knots and 3-Manifolds
inferredcites →https://doi.org/10.2307/2284618openalex-snapshot
Combinatorial Mathematics and Its Applications.
inferredcites →https://doi.org/10.6100/ir272918openalex-snapshot
Translating programs into delay-insensitive circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_9openalex-snapshot
A Finite Complete Set of Equations Generating Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45263-x_17openalex-snapshot
A Formalization of the IWIM Model
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_3openalex-snapshot
Normal Forms for Partitions and Relations
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_36openalex-snapshot
An inductive view of graph transformation
inferred← citeshttps://doi.org/10.1007/978-3-030-16722-6_15openalex-snapshot
SL2SF: Refactoring Simulink to Stateflow
inferred← citeshttps://doi.org/10.1007/978-3-030-78142-2_13openalex-snapshot
The Structure of Concurrent Process Histories
inferred← citeshttps://doi.org/10.1007/978-3-030-90636-8_4openalex-snapshot
A Canonical Algebra of Open Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_9openalex-snapshot
A Programming Language for Spatial Distribution of Net Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_18openalex-snapshot
Compositional Reachability in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_36openalex-snapshot
Calculating Colimits Compositionally
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_38openalex-snapshot
Representations of Petri Net Interactions
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_2openalex-snapshot
Connector Algebras, Petri Nets, and BIP
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_23openalex-snapshot
Interacting Bialgebras Are Frobenius
inferred← citeshttps://doi.org/10.1007/bfb0000480openalex-snapshot
Representing place/transition nets in Span(Graph)
inferred← citeshttps://doi.org/10.1007/s00236-004-0149-8openalex-snapshot
An axiomatization of graphs
inferred← citeshttps://doi.org/10.1007/s10270-023-01092-7openalex-snapshot
Span(Graph): a canonical feedback algebra of open transition systems
inferred← citeshttps://doi.org/10.1007/s10485-010-9233-0openalex-snapshot
The Compositional Construction of Markov Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.020openalex-snapshot
Timing in the Cospan-Span Model
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.025openalex-snapshot
Compositional Minimization in Span(Graph): Some Examples
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.014openalex-snapshot
A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.01.036openalex-snapshot
An Algebra of Automata That Includes Both Classical and Quantum Entities
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.009openalex-snapshot
Towards Compositional Graph Theory
inferred← citeshttps://doi.org/10.1016/j.ic.2016.03.002openalex-snapshot
The Calculus of Signal Flow Diagrams I: Linear relations on streams
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.007openalex-snapshot
Relational presheaves, change of base and weak simulation
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.072openalex-snapshot
Components as coalgebras: The refinement dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.028openalex-snapshot
On the geometry and algebra of networks with state
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00318-8openalex-snapshot
Normal forms for algebras of connections
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00362-0openalex-snapshot
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00011-7openalex-snapshot
Dynamic connectors for concurrency
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00894-0openalex-snapshot
Categorical foundations for randomly timed automata
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00325-1openalex-snapshot
Comparing cospan-spans and tiles via a Hoare-style process calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80501-2openalex-snapshot
Concrete Process Categories
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80937-xopenalex-snapshot
Some algebraic laws for spans (and their connections with multirelations)1 1Research partly supported by the EC TMR Network getgrats and by the Italian MURST Project tosca.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81003-xopenalex-snapshot
Hierarchical automata and P-systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80309-3openalex-snapshot
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting
inferred← citeshttps://doi.org/10.1017/s096012950400430xopenalex-snapshot
Minimisation and minimal realisation in Span(Graph)
inferred← citeshttps://doi.org/10.1023/a:1008647417502openalex-snapshot
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
inferred← citeshttps://doi.org/10.1051/ita/2011015openalex-snapshot
The compositional construction of Markov processes II
inferred← citeshttps://doi.org/10.1051/ita:2002009openalex-snapshot
Feedback, trace and fixed-point semantics
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00047openalex-snapshot
Effectful Mealy Machines: Bisimulation and Trace
inferred← citeshttps://doi.org/10.1145/2676726.2676993openalex-snapshot
Full Abstraction for Signal Flow Graphs
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:16)2013openalex-snapshot
Connector algebras for C/E and P/T nets' interactions
inferred← citeshttps://doi.org/10.3934/mine.2023036openalex-snapshot
A diagrammatic view of differential equations in physics
inferred← citeshttps://doi.org/10.4204/eptcs.12.6openalex-snapshot
A non-interleaving process calculus for multi-party synchronisation
inferred← citeshttps://doi.org/10.4204/eptcs.261.3openalex-snapshot
From Wires to Circuits Through Nets
inferred← citeshttps://doi.org/10.4204/eptcs.263.2openalex-snapshot
Rewriting in Free Hypergraph Categories
inferred← citeshttps://doi.org/10.4204/eptcs.397.13openalex-snapshot
Structured and Decorated Cospans from the Viewpoint of Double Category Theory
inferred← citeshttps://doi.org/10.4230/lipics.concur.2017.24openalex-snapshot
Refinement for Signal Flow Graphs
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:7)2023openalex-snapshot
Concurrent Process Histories and Resource Transducers
inferred← citeshttps://doi.org/10.48550/arxiv.0901.4754openalex-snapshot
An algebra of automata which includes both classical and quantum entities
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3961openalex-snapshot
The parallel composition of processes
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3964openalex-snapshot
A process algebra for the Span(Graph) model of concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.0909.4136openalex-snapshot
Cospans and spans of graphs: a categorical algebra for the sequential and parallel composition of discrete systems
inferred← citeshttps://doi.org/10.5287/ora-8jm2mzaqwopenalex-snapshot
Picturing resources in concurrency
inferred← citeshttps://doi.org/10.70930/tac/8ej2pxy9openalex-snapshot
Formal composition of hybrid systems
inferred← citeshttps://doi.org/10.70930/tac/k1iphgn8openalex-snapshot
Generic commutative separable algebras and cospans of graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.