23 citations · 55 across the 16 of their papers we have counts for
17 papers
Validity of contextual formulas (extended version)
Javier Esparza, Rubén Rubio
Many well-known logical identities are naturally written as equivalences between contextual formulas. A simple example is the Boole-Shannon expansion $c[p] \equiv (p \wedge c[\math…
Left-Linear Rewriting in Adhesive Categories
Paolo Baldan, Davide Castelnovo, Andrea Corradini +1
When can two sequential steps performed by a computing device be considered (causally) independent? This is a relevant question for concurrent and distributed systems, since indepe…
Specification and verification of a linear-time logic for graph transformation
Fabio Gadducci, Andrea Laretto, Davide Trotta
We present a first-order linear-time temporal logic for reasoning about the evolution of directed graphs. Its semantics is based on the counterpart paradigm, thus allowing our logi…
Weakly Markov categories and weakly affine monads
Tobias Fritz, Fabio Gadducci, Paolo Perrone +1
Introduced in the 1990s in the context of the algebraic approach to graph rewriting, gs-monoidal categories are symmetric monoidal categories where each object is equipped with the…
From Gs-monoidal to Oplax Cartesian Categories: Constructions and Functorial Completeness
Tobias Fritz, Fabio Gadducci, Davide Trotta +1
Originally introduced in the context of the algebraic approach to term graph rewriting, the notion of gs-monoidal category has surfaced a few times under different monikers in the…
A new criterion for -adhesivity, with an application to hierarchical graphs
Davide Castelnovo, Fabio Gadducci, Marino Miculan
Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking t…
A Presheaf Semantics for Quantified Temporal Logics
Fabio Gadducci, Davide Trotta
Temporal logics stands for a widely adopted family of formalisms for the verification of computational devices, enriching propositional logics by operators predicating on the step-…
String Diagram Rewrite Theory III: Confluence with and without Frobenius
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger +2
In this paper we address the problem of proving confluence for string diagram rewriting, which was previously shown to be characterised combinatorically as double-pushout rewriting…
String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger +2
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or disc…
Residuation for Soft Constraints: Lexicographic Orders and Approximation Techniques
Fabio Gadducci, Francesco Santini
Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of appl…
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger +2
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the m…
A spatial model checker in GPU (extended version)
Laura Bussi, Vincenzo Ciancia, Fabio Gadducci
The tool voxlogica merges the state-of-the-art library of computational imaging algorithms ITK with the combination of declarative specification and optimised execution provided by…
Retracing and assessing the CEP project
Giovanni A. Cignoni, Fabio Gadducci
The last decade witnessed a renewed interest in the development of the Italian computer industry and in the role of the Fifties pioneers in Rome, Milan, Ivrea, and Pisa. The aim of…
Event Structures for Petri nets with Persistence
Paolo Baldan, Roberto Bruni, Andrea Corradini +3
Event structures are a well-accepted model of concurrency. In a seminal paper by Nielsen, Plotkin and Winskel, they are used to establish a bridge between the theory of domains and…
Domains and Event Structures for Fusions
Paolo Baldan, Andrea Corradini, Fabio Gadducci
Stable event structures, and their duality with prime algebraic domains arising as partial orders of configurations, are a landmark of concurrency theory, providing a clear charact…
Rewriting modulo symmetric monoidal structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger +2
String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming in…
On Barbs and Labels in Reactive Systems
Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale
Reactive systems (RSs) represent a meta-framework aimed at deriving behavioral congruences for those computational formalisms whose operational semantics is provided by reduction r…