activity
20112026
most citedEvent Structures for Petri nets with Persistence

9 citations · 16 across the 10 of their papers we have counts for

collaborators

10 papers

cs.LO2026

Structural Morphisms for Nested Conditions - Full Version

Arend Rensink, Andrea Corradini

Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this…

cs.LO2022★ 2 cited

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…

cs.LO2020

Encoding Incremental NACs in Safe Graph Grammars using Complementation

Andrea Corradini, Maryam Ghaffari Saadat, Reiko Heckel

In modelling complex systems with graph grammars (GGs), it is convenient to restrict the application of rules using attribute constraints and negative application conditions (NACs)…

cs.LO2019★ 2 cited

Rewriting Abstract Structures: Materialization Explained Categorically

Andrea Corradini, Tobias Heindel, Barbara König +2

The paper develops an abstract (over-approximating) semantics for double-pushout rewriting of graphs and graph-like objects. The focus is on the so-called materialization of left-h…

cs.LO2018★ 9 cited

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…

cs.FL2017

Specifying Graph Languages with Type Graphs

Andrea Corradini, Barbara König, Dennis Nolte

We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding langu…

cs.LO2017

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…

cs.LO2016

Proceedings 9th International Workshop on Computing with Terms and Graphs

Andrea Corradini, Hans Zantema

This volume contains the proceedings of TERMGRAPH 2016, the Ninth International Workshop on Computing with Terms and Graphs which was held on April 8, 2016 in Eindhoven, The Nether…

cs.LO2014★ 2 cited

AGREE -- Algebraic Graph Rewriting with Controlled Embedding (Long Version)

Anadrea Corradini, Dominique Duval, Rachid Echahed +2

The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph…

cs.LO2011★ 1 cited

Term Graph Rewriting and Parallel Term Rewriting

Andrea Corradini, Frank Drewes

The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is…