Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Adhesive DPO Parallelism for Monic Matches
Electronic Notes in Theoretical Computer Science (ENTCS)
A semantic framework for open processes
Theoretical Computer Science
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Parallel and Sequential Independence for Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
On the Recognizability of Arrow and Graph Languages
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
G-Reactive Systems as Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesising CCS bisimulation using graph rewriting
Information and Computation
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A Coalgebraic Theory of Reactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On Symbolic Semantics for Name-decorated Contexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving bisimulation congruences with borrowed contexts
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Structured co-spans: an algebra of interaction protocols
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Quasitoposes, quasiadhesive categories and artin glueing
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A behavioural congruence for web services
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
RPO, second-order contexts, and λ-calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Deriving bisimulation congruences in the presence of negative application conditions
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Van Kampen colimits as bicolimits in span
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Deriving structural labelled transitions for mobile ambients
Information and Computation
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Recognizable graph languages for the verification of dynamic systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Bisimulation theory for graph transformation systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Composition and decomposition of DPO transformations with borrowed context
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
ICGT'06 Proceedings of the Third international conference on Graph Transformations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
Towards a general theory of barbs, contexts and labels
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Deriving bisimulation congruences for conditional reactive systems
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Efficient symbolic implementation of graph automata with applications to invariant checking
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated ...