Solutions of functorial and non-functorial metric domain equations. - Fabio Alessi; Paolo Baldan; Gianna Bellè; Jan J. M. M. Rutten (MFPS, 1995)

A Fixed-Point Theorem in a Category of Compact Metric Spaces. - Fabio Alessi; Paolo Baldan; Gianna Bellè (Theor. Comput. Sci., 1995)

Partializing Stone Spaces using SFP Domains (Extended Abstract). - Fabio Alessi; Paolo Baldan; Furio Honsell (TAPSOFT, 1997)

An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (FoSSaCS, 1998)

Concatenable Graph Processes: Relating Processes and Derivation Traces. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (ICALP, 1998)

Unfolding of Double-Pushout Graph Grammars is a Coreflection. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (TAGT, 1998)

A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space. - Fabio Alessi; Paolo Baldan (Theor. Comput. Sci., 1998)

Unfolding and Event Structure Semantics for Graph Grammars. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (FoSSaCS, 1999)

History Preserving Bisimulation for Contextual Nets. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (WADT, 1999)

Basic Theory of F-Bounded Quantification. - Paolo Baldan; Giorgio Ghelli; Alessandra Raffaetà (Inf. Comput., 1999)

Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs. - Paolo Baldan; Nadia Busi; Andrea Corradini 001; G. Michele Pinna (CONCUR, 2000)

Compositional Modeling of Reactive Systems Using Open Nets. - Paolo Baldan; Andrea Corradini 001; Hartmut Ehrig; Reiko Heckel (CONCUR, 2001)

A Static Analysis Technique for Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (CONCUR, 2001)

Concurrency for Graph Grammars in a Petri net shell. - Paolo Baldan (GETGRATS Closing Workshop, 2001)

Contextual Petri Nets, Asymmetric Event Structures, and Processes. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (Inf. Comput., 2001)

Bisimulation by Unification. - Paolo Baldan; Andrea Bracciali; Roberto Bruni 001 (AMAST, 2002)

Bisimulation Equivalences for Graph Grammars. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (Formal and Natural Computing, 2002)

MuTACLP: A Language for Temporal Reasoning with Multiple Theories. - Paolo Baldan; Paolo Mancarella; Alessandra Raffaetà; Franco Turini (Computational Logic: Logic Programming and Beyond, 2002)

High-Level Net Processes. - Hartmut Ehrig; Kathrin Hoffmann; Julia Padberg; Paolo Baldan; Reiko Heckel (Formal and Natural Computing, 2002)

Approximating the Behaviour of Graph Transformation Systems. - Paolo Baldan; Barbara König 001 (ICGT, 2002)

AGILE: Software Architecture for Mobility. - Luís Andrade 001; Paolo Baldan; Hubert Baumeister; Roberto Bruni 001; Andrea Corradini 001; Rocco De Nicola; José Luiz Fiadeiro; Fabio Gadducci; Stefania Gnesi; Piotr Hoffman; Nora Koch; Piotr Kosiuczenko; et al. (WADT, 2002)

Pre-nets, Read Arcs and Unfolding: A Functorial Presentation. - Paolo Baldan; Roberto Bruni 001; Ugo Montanari (WADT, 2002)

Coreflective Concurrent Semantics for Single-Pushout Graph Grammars. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari; Leila Ribeiro 001 (WADT, 2002)

A Logic for Analyzing Abstractions of Graph Transformation Systems. - Paolo Baldan; Barbara König 001; Bernhard König (SAS, 2003)

Verifying a Behavioural Logic for Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001; Bernhard König (COMETA, 2003)

A category of compositional domain-models for separable Stone spaces. - Fabio Alessi; Paolo Baldan; Furio Honsell (Theor. Comput. Sci., 2003)

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (CONCUR, 2004)

Summary 2: Graph Grammar Verification through Abstraction. - Paolo Baldan; Barbara König 001; Arend Rensink (Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004)

Symbolic Equivalences for Open Systems. - Paolo Baldan; Andrea Bracciali; Roberto Bruni 001 (Global Computing, 2004)

Specifying and Verifying UML Activity Diagrams Via Graph Transformation. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci (Global Computing, 2004)

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems. - Paolo Baldan; Barbara König 001; Ingo Stürmer (ICGT, 2004)

Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari (PNGT@ICGT, 2004)

A Rewriting Calculus for Cyclic Higher-order Term Graphs. - Clara Bertolissi; Paolo Baldan; Horatiu Cirstea; Claude Kirchner (TERMGRAPH, 2004)

Domain and event structure semantics for Petri nets with read and inhibitor arcs. - Paolo Baldan; Nadia Busi; Andrea Corradini 001; G. Michele Pinna (Theor. Comput. Sci., 2004)

On the Concurrent Semantics of Algebraic Graph Grammars. - Paolo Baldan; Andrea Corradini 001 (Formal Methods in Software and Systems Modeling, 2005)

Compositional semantics for open Petri nets based on deterministic processe. - Paolo Baldan; Andrea Corradini 001; Hartmut Ehrig; Reiko Heckel (Math. Struct. Comput. Sci., 2005)

Concurrent Rewriting for Graphs with Equivalences. - Paolo Baldan; Fabio Gadducci; Ugo Montanari (CONCUR, 2006)

Processes for Adhesive Rewriting Systems. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (FoSSaCS, 2006)

Distributed Unfolding of Petri Nets. - Paolo Baldan; Stefan Haar; Barbara König 001 (FoSSaCS, 2006)

Graph Transactions as Processes. - Paolo Baldan; Andrea Corradini 001; Luciana Foss; Fabio Gadducci (ICGT, 2006)

Composition and Decomposition of DPO Transformations with Borrowed Context. - Paolo Baldan; Hartmut Ehrig; Barbara König 001 (ICGT, 2006)

Workshop on Petri Nets and Graph Transformations. - Paolo Baldan; Hartmut Ehrig; Julia Padberg; Grzegorz Rozenberg (ICGT, 2006)

A Temporal Graph Logic for Verification of Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001; Alberto Lluch-Lafuente (WADT, 2006)

Foreword. - Paolo Baldan; Hartmut Ehrig; Julia Padberg; Grzegorz Rozenberg (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2006)

Towards a Notion of Transaction in Graph Rewriting. - Paolo Baldan; Andrea Corradini 001; Fernando Luís Dotti; Luciana Foss; Fabio Gadducci; Leila Ribeiro 001 (GT-VMT@ETAPS, 2006)

Modelling Calculi with Name Mobility using Graphs with Equivalences. - Paolo Baldan; Fabio Gadducci; Ugo Montanari (TERMGRAPH@ETAPS, 2006)

Deducing Interactions in Partially Unspecified Biological Systems. - Paolo Baldan; Andrea Bracciali; Linda Brodo; Roberto Bruni 001 (AB, 2007)

Towards a Sharing Strategy for the Graph Rewriting Calculus. - Paolo Baldan; Clara Bertolissi; Horatiu Cirstea; Claude Kirchner (WRS@RDP, 2007)

Unfolding semantics of graph transformation. - Paolo Baldan; Andrea Corradini 001; Ugo Montanari; Leila Ribeiro 001 (Inf. Comput., 2007)

A semantic framework for open processes. - Paolo Baldan; Andrea Bracciali; Roberto Bruni 001 (Theor. Comput. Sci., 2007)

Petri Nets Are Dioids. - Paolo Baldan; Fabio Gadducci (AMAST, 2008)

Unfolding Graph Transformation Systems: Theory and Applications to Verification. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (Concurrency, Graphs and Models, 2008)

Open Petri Nets: Non-deterministic Processes and Compositionality. - Paolo Baldan; Andrea Corradini 001; Hartmut Ehrig; Barbara König 001 (ICGT, 2008)

Workshop on Petri Nets and Graph Transformations. - Paolo Baldan; Barbara König 001 (ICGT, 2008)

Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts. - Guilherme Rangel; Leen Lambers; Barbara König 001; Hartmut Ehrig; Paolo Baldan (ICGT, 2008)

Preface. - Paolo Baldan; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2008)

A framework for the verification of infinite-state graph transformation systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (Inf. Comput., 2008)

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets. - Paolo Baldan; Andrea Corradini 001; Hartmut Ehrig; Reiko Heckel; Barbara König 001 (Log. Methods Comput. Sci., 2008)

McMillan's Complete Prefix for Contextual Nets. - Paolo Baldan; Andrea Corradini 001; Barbara König 001; Stefan Schwoon (Trans. Petri Nets Other Model. Concurr., 2008)

Unfolding Grammars in Adhesive Categories. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (CALCO, 2009)

Encoding Asynchronous Interactions Using Open Petri Nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci (CONCUR, 2009)

Concurrency Can't Be Observed, Asynchronously. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (APLAS, 2010)

On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars. - Paolo Baldan; Alessandro Bruni; Andrea Corradini 001; Barbara König 001; Stefan Schwoon (ICGT, 2010)

Sharing in the Graph Rewriting Calculus. - Paolo Baldan; Clara Bertolissi (WADT, 2010)

From Petri Nets to Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci; Ugo Montanari (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Unfolding-based diagnosis of systems with an evolving topology. - Paolo Baldan; Thomas Chatain; Stefan Haar; Barbara König 001 (Inf. Comput., 2010)

Petri nets for modelling metabolic pathways: a survey. - Paolo Baldan; Nicoletta Cocco; Andrea Marin; Marta Simeoni (Nat. Comput., 2010)

Efficient Contextual Unfolding. - César Rodríguez; Stefan Schwoon; Paolo Baldan (CONCUR, 2011)

Adhesivity Is Not Enough: Local Church-Rosser Revisited. - Paolo Baldan; Fabio Gadducci; Pawel Sobocinski 001 (MFCS, 2011)

A lattice-theoretical perspective on adhesive categories. - Paolo Baldan; Filippo Bonchi; Andrea Corradini 001; Tobias Heindel; Barbara König 001 (J. Symb. Comput., 2011)

Efficient unfolding of contextual Petri nets. - Paolo Baldan; Alessandro Bruni; Andrea Corradini 001; Barbara König 001; César Rodríguez; Stefan Schwoon (Theor. Comput. Sci., 2012)

Comparing metabolic pathways through potential fluxes: a selective opening approach. - Paolo Baldan; Martina Bocci; Nicoletta Cocco; Marta Simeoni (BioPPN@Petri Nets, 2013)

Representing and Comparing Metabolic Pathways as Petri Nets with MPath2PN and CoMeta. - Paolo Baldan; Nicoletta Cocco; Marta Simeoni (CS2Bio, 2013)

Comparing Metabolic Pathways through Reactions and Potential Fluxes. - Paolo Baldan; Nicoletta Cocco; Federica Giummolè; Marta Simeoni (Trans. Petri Nets Other Model. Concurr., 2013)

Hereditary History-Preserving Bisimilarity: Logics and Automata. - Paolo Baldan; Silvia Crafa (APLAS, 2014)

Non-interference by Unfolding. - Paolo Baldan; Alberto Carraro (Petri Nets, 2014)

Behavioral Comparison of Process Models Based on Canonically Reduced Event Structures. - Abel Armas-Cervantes; Paolo Baldan; Marlon Dumas; Luciano García-Bañuelos (BPM, 2014)

BP-Diff: A Tool for Behavioral Comparison of Business Process Models. - Abel Armas; Paolo Baldan; Marlon Dumas; Luciano García-Bañuelos (BPM (Demos), 2014)

Encoding Synchronous Interactions Using Labelled Petri Nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (COORDINATION, 2014)

Intransitive Non-Interference by Unfolding. - Paolo Baldan; Francesco Burato; Alberto Carraro (FACS, 2014)

Behavioral Metrics via Functor Lifting. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (FSTTCS, 2014)

A Logic for True Concurrency. - Paolo Baldan; Silvia Crafa (J. ACM, 2014)

Processes and unfoldings: concurrent computations in adhesive categories. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (Math. Struct. Comput. Sci., 2014)

Petri nets for modelling and analysing trophic networks. - Paolo Baldan; Martina Bocci; Daniele Brigolin; Nicoletta Cocco; Marta Simeoni (BioPPN@Petri Nets, 2015)

Asynchronous Traces and Open Petri Nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (Programming Languages with Applications to Biology and Security, 2015)

Towards Trace Metrics via Functor Lifting. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (CALCO, 2015)

A Causal View on Non-Interference. - Paolo Baldan; Alberto Carraro (Fundam. Informaticae, 2015)

Concurrency cannot be observed, asynchronously. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (Math. Struct. Comput. Sci., 2015)

Modular encoding of synchronous and asynchronous interactions using open Petri nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (Sci. Comput. Program., 2015)

Diagnosing behavioral differences between business process models: An approach based on event structures. - Abel Armas-Cervantes; Paolo Baldan; Marlon Dumas; Luciano García-Bañuelos (Inf. Syst., 2016)

Reduction of event structures under history preserving bisimulation. - Abel Armas-Cervantes; Paolo Baldan; Luciano García-Bañuelos (J. Log. Algebraic Methods Program., 2016)

Many-to-Many Information Flow Policies. - Paolo Baldan; Alessandro Beggiato; Alberto Lluch-Lafuente (COORDINATION, 2017)

Local Model Checking in a Logic for True Concurrency. - Paolo Baldan; Tommaso Padoan (FoSSaCS, 2017)

Domains and event structures for fusions. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci (LICS, 2017)

Preface. - Paolo Baldan; Daniele Gorla (Inf. Comput., 2017)

Automata for True Concurrency Properties. - Paolo Baldan; Tommaso Padoan (FoSSaCS, 2018)

Petri Nets for Modelling and Analysing Trophic Networks. - Paolo Baldan; Martina Bocci; Daniele Brigolin; Nicoletta Cocco; Monika Heiner; Marta Simeoni (Fundam. Informaticae, 2018)

Event Structures for Petri nets with Persistence. - Paolo Baldan; Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Hernán C. Melgratti; Ugo Montanari (Log. Methods Comput. Sci., 2018)

Coalgebraic Behavioral Metrics. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (Log. Methods Comput. Sci., 2018)

Many-to-many information flow policies. - Paolo Baldan; Alberto Lluch-Lafuente (Sci. Comput. Program., 2018)

Multilevel transitive and intransitive non-interference, causally. - Paolo Baldan; Alessandro Beggiato (Theor. Comput. Sci., 2018)

Petri nets are dioids: a new algebraic foundation for non-deterministic net theory. - Paolo Baldan; Fabio Gadducci (Acta Informatica, 2019)

Fixpoint games on continuous lattices. - Paolo Baldan; Barbara König 001; Christina Mika-Michalski; Tommaso Padoan (Proc. ACM Program. Lang., 2019)

Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations. - Paolo Baldan; Barbara König 001; Tommaso Padoan (CONCUR, 2020)

Model Checking a Logic for True Concurrency. - Paolo Baldan; Tommaso Padoan (ACM Trans. Comput. Log., 2020)

A Rice's Theorem for Abstract Semantics. - Paolo Baldan; Francesco Ranzato; Linpeng Zhang (ICALP, 2021)

(Un)Decidability for History Preserving True Concurrent Logics. - Paolo Baldan; Alberto Carraro; Tommaso Padoan (MFCS, 2021)

Concurrent semantics for fusions: Weak prime domains and connected event structures. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci (Inf. Comput., 2021)

Characterising spectra of equivalences for event structures, logically. - Paolo Baldan; Daniele Gorla; Tommaso Padoan; Ivano Salvo (Inf. Comput., 2022)

Intensional Kleene and Rice theorems for abstract program semantics. - Paolo Baldan; Francesco Ranzato; Linpeng Zhang (Inf. Comput., 2022)

Behavioural logics for configuration structures. - Paolo Baldan; Daniele Gorla; Tommaso Padoan; Ivano Salvo (Theor. Comput. Sci., 2022)

Minimisation of event structures. - Paolo Baldan; Alessandra Raffaetà (Theor. Comput. Sci., 2022)

A Lattice-Theoretical View of Strategy Iteration. - Paolo Baldan; Richard Eggert; Barbara König 001; Tommaso Padoan (CSL, 2023)

Fixpoint Theory - Upside Down. - Paolo Baldan; Richard Eggert; Barbara König 001; Tommaso Padoan (Log. Methods Comput. Sci., 2023)

Left-Linear Rewriting in Adhesive Categories. - Paolo Baldan; Davide Castelnovo; Andrea Corradini 001; Fabio Gadducci (CONCUR, 2024)

Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms. - Paolo Baldan; Barbara König 001; Tommaso Padoan (Inf. Comput., 2024)

Approximating Fixpoints of Approximated Functions. - Paolo Baldan; Sebastian Gurke; Barbara König 001; Tommaso Padoan; Florian Wittbold (CAV (2), 2025)

Model Checking as Program Verification by Abstract Interpretation. - Paolo Baldan; Roberto Bruni 001; Francesco Ranzato; Diletta Rigo (CONCUR, 2025)

A Monoidal View on Fixpoint Checks. - Paolo Baldan; Richard Eggert; Barbara König 001; Timo Matt; Tommaso Padoan (Log. Methods Comput. Sci., 2025)

Computing Approximated Fixpoints via Dampened Mann Iteration. - Paolo Baldan; Sebastian Gurke; Barbara König 001; Tommaso Padoan; Florian Wittbold (CoRR, 2025)

Model Checking as Program Verification by Abstract Interpretation (Extended Version). - Paolo Baldan; Roberto Bruni 001; Francesco Ranzato; Diletta Rigo (CoRR, 2025)