Fabio Gadducci

From MaRDI portal
Person:344544

Available identifiers

zbMath Open gadducci.fabioDBLPg/FabioGadducciWikidataQ102408078 ScholiaQ102408078MaRDI QIDQ344544

List of research outcomes





PublicationDate of PublicationType
Weakly Markov categories and weakly affine monads2024-11-26Paper
A presheaf semantics for quantified temporal logics2024-06-26Paper
A spatial logic with time and quantifiers2024-05-29Paper
Polyadic Soft Constraints2024-03-14Paper
Data-driven choreographies à la Klaim2024-02-23Paper
A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity2024-02-23Paper
A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs2024-01-23Paper
Specification and verification of a linear-time temporal logic for graph transformation2024-01-12Paper
https://portal.mardi4nfdi.de/entity/Q60616822023-12-08Paper
From gs-monoidal to oplax cartesian categories: constructions and functorial completeness2023-10-18Paper
Specification and modelling of computing systems through graphs and graph transformation2023-09-25Paper
Weakly Markov categories and weakly affine monads2023-03-24Paper
String diagram rewrite theory III: Confluence with and without Frobenius2023-02-28Paper
https://portal.mardi4nfdi.de/entity/Q58756782023-02-03Paper
String diagram rewrite theory II: Rewriting with symmetric monoidal structure2022-12-20Paper
Relating two categorical models of term rewriting2022-12-09Paper
Graph Rewriting Components2022-12-07Paper
CPO models for infinite term rewriting2022-08-16Paper
Distributivity and residuation for lexicographic orders2022-06-03Paper
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure2022-03-31Paper
Categorical specification and implementation of replicated data types2022-02-01Paper
Residuation for soft constraints: lexicographic orders and approximation techniques2021-12-01Paper
Concurrent semantics for fusions: weak prime domains and connected event structures2021-11-25Paper
A Presheaf Semantics for Quantified Temporal Logics2021-11-06Paper
Implementation correctness for replicated data types, categorically2021-07-08Paper
Soft constraint automata with memory2021-06-03Paper
Soft constraint automata with memory2021-02-26Paper
https://portal.mardi4nfdi.de/entity/Q51501302021-02-09Paper
Rewriting with Frobenius2021-01-20Paper
https://portal.mardi4nfdi.de/entity/Q51446822021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q46211402019-02-08Paper
Petri nets are dioids: a new algebraic foundation for non-deterministic net theory2019-01-25Paper
https://portal.mardi4nfdi.de/entity/Q45532762018-11-02Paper
Rewriting modulo symmetric monoidal structure2018-04-23Paper
Observational and behavioural equivalences for soft concurrent constraint programming2017-09-12Paper
Confluence of Graph Rewriting with Interfaces2017-05-19Paper
Residuation for bipolar preferences in soft constraints2016-11-23Paper
Concurrency cannot be observed, asynchronously2016-07-27Paper
RPO semantics for mobile ambients2016-07-26Paper
Asynchronous Traces and Open Petri Nets2016-01-08Paper
A General Theory of Barbs, Contexts, and Labels2015-09-17Paper
A White Box Perspective on Behavioural Adaptation2015-06-22Paper
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)2014-07-23Paper
A Note on an Old-Fashioned Algebra for (Disconnected) Graphs2014-07-23Paper
Towards a Notion of Transaction in Graph Rewriting2014-03-21Paper
A calculus for team automata2014-01-24Paper
Modelling calculi with name mobility using graphs with equivalences2013-12-20Paper
Graphical verification of a spatial logic for the {\(\pi\)}-calculus2013-10-07Paper
On term graphs as an adhesive category2013-09-25Paper
Adaptable Transition Systems2013-09-13Paper
Barbed Semantics for Open Reactive Systems2013-09-13Paper
Some characterization results for permutation algebras2013-09-11Paper
Inequational deduction as term graph rewriting2013-08-27Paper
GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs2013-08-16Paper
A presheaf environment for the explicit fusion calculus2013-08-01Paper
Comparing cospan-spans and tiles via a Hoare-style process calculus2013-07-24Paper
Categorical rewriting of term-like structures2013-05-24Paper
A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).2013-04-26Paper
Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models2012-10-02Paper
A Modular LTS for Open Reactive Systems2012-09-21Paper
Counterpart semantics for a second-order \(\mu\)-calculus2012-07-11Paper
An Institution for Graph Transformation2012-06-08Paper
Adhesivity Is Not Enough: Local Church-Rosser Revisited2011-08-17Paper
A decentralised graphical implementation of mobile ambients2011-02-09Paper
On GS-Monoidal Theories for Graphs with Nesting2010-11-26Paper
Counterpart Semantics for a Second-Order μ-Calculus2010-10-04Paper
Saturated LTSs for Adhesive Rewriting Systems2010-10-04Paper
Programming Languages and Systems2010-01-05Paper
Perspectives of System Informatics2010-01-05Paper
A Net-based Approach to Web Services Publication and Replaceability2009-11-30Paper
Encoding Asynchronous Interactions Using Open Petri Nets2009-10-22Paper
A Term-Graph Syntax for Algebras over Multisets2009-10-22Paper
Reactive Systems, Barbed Semantics, and the Mobile Ambients2009-03-31Paper
Graphical Encoding of a Spatial Logic for the π-Calculus2009-03-10Paper
Synthesising CCS bisimulation using graph rewriting2009-03-02Paper
https://portal.mardi4nfdi.de/entity/Q36014132009-02-10Paper
Petri Nets Are Dioids2009-01-27Paper
A Soft Approach to Multi-objective Optimization2009-01-22Paper
Process Bisimulation Via a Graphical Encoding2008-11-27Paper
Graph Transactions as Processes2008-11-27Paper
A Decentralized Implementation of Mobile Ambients2008-11-20Paper
Parallel and Sequential Independence for Borrowed Contexts2008-11-20Paper
Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study2008-07-03Paper
A Behavioural Congruence for Web Services2008-07-01Paper
A Category of Explicit Fusions2008-06-19Paper
Ugo Montanari and Friends2008-06-19Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Graph rewriting for the π-calculus2007-09-26Paper
Concurrent Rewriting for Graphs with Equivalences2007-09-04Paper
About permutation algebras, (pre)sheaves and named sets2006-11-17Paper
Processes, Terms and Cycles: Steps on the Road to Infinity2006-11-13Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
Processes as formal power series: a coinductive approach to denotational semantics2006-09-14Paper
Formal Methods in Software and Systems Modeling2005-12-02Paper
Global Computing2005-08-19Paper
Normal forms for algebras of connections.2003-01-21Paper
A functorial semantics for multi-algebras and partial algebras, with applications to syntax.2003-01-21Paper
Comparing logics for rewriting: Rewriting logic, action calculi and tile logic2002-08-13Paper
A causal semantics for CCS via rewriting logic2002-07-31Paper
https://portal.mardi4nfdi.de/entity/Q44992302001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q45028172000-09-12Paper
https://portal.mardi4nfdi.de/entity/Q49419272000-08-21Paper
Rewriting on cyclic structures: Equivalence between the operational and the categorical description2000-05-11Paper
An algebraic presentation of term graphs, via gs-monoidal categories2000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q49419242000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42190301999-05-18Paper
https://portal.mardi4nfdi.de/entity/Q42228481998-12-20Paper
https://portal.mardi4nfdi.de/entity/Q38390561998-11-26Paper
https://portal.mardi4nfdi.de/entity/Q38390711998-10-08Paper
https://portal.mardi4nfdi.de/entity/Q43629621998-06-02Paper

Research outcomes over time

This page was built for person: Fabio Gadducci