4 citations · 4 across the 1 of their papers we have counts for
7 papers · 1 filter
Cartesian bicategories with choice
Filippo Bonchi, Jens Seeber, Pawel Sobocinski
Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algeb…
Contextual Equivalence for Signal Flow Graphs
Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski +1
We extend the signal flow calculus---a compositional account of the classical signal flow graph model of computation---to encompass affine behaviour, and furnish it with a novel op…
Bialgebraic Semantics for String Diagrams
Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski +1
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as…
Graphical Conjunctive Queries
Filippo Bonchi, Jens Seeber, Pawel Sobocinski
The Calculus of Conjunctive Queries (CCQ) has foundational status in database theory. A celebrated theorem of Chandra and Merlin states that CCQ query inclusion is decidable. Its p…
Functorial Semantics for Relational Theories
Filippo Bonchi, Dusko Pavlovic, Pawel Sobocinski
We introduce the concept of Frobenius theory as a generalisation of Lawvere's functorial semantics approach to categorical universal algebra. Whereas the universe for models of Law…
Compositional model checking of concurrent systems, with Petri nets
Paweł Sobociński
Compositionality and process equivalence are both standard concepts of process algebra. Compositionality means that the behaviour of a compound system relies only on the behaviour…