Fabio Gadducci

According to our database1, Fabio Gadducci authored at least 122 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Petri nets are dioids: a new algebraic foundation for non-deterministic net theory.
Acta Inf., 2019

Data-Driven Choreographies à la Klaim.
Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018
On the semantics and implementation of replicated data types.
Sci. Comput. Program., 2018

Event Structures for Petri nets with Persistence.
Logical Methods in Computer Science, 2018

Rewriting with Frobenius.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Soft Constraint Automata with Memory.
Proceedings of the It's All About Coordination, 2018

2017
Observational and behavioural equivalences for soft concurrent constraint programming.
J. Log. Algebr. Meth. Program., 2017

Residuation for bipolar preferences in soft constraints.
Inf. Process. Lett., 2017

Domains and event structures for fusions.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Confluence of Graph Rewriting with Interfaces.
Proceedings of the Programming Languages and Systems, 2017

A Denotational View of Replicated Data Types.
Proceedings of the Coordination Models and Languages, 2017

2016
Rewriting modulo symmetric monoidal structure.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Reconciling White-Box and Black-Box Perspectives on Behavioral Self-adaptation.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

Modular encoding of synchronous and asynchronous interactions using open Petri nets.
Sci. Comput. Program., 2015

Concurrency cannot be observed, asynchronously.
Mathematical Structures in Computer Science, 2015

Verification of Evolving Graph Structures (Dagstuhl Seminar 15451).
Dagstuhl Reports, 2015

A Labelled Semantics for Soft Concurrent Constraint Programming.
Proceedings of the Coordination Models and Languages, 2015

A White Box Perspective on Behavioural Adaptation.
Proceedings of the Software, 2015

Asynchronous Traces and Open Petri Nets.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

Awareness and Control in Adaptable Transition Systems.
Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'15), 2015

2014
A General Theory of Barbs, Contexts, and Labels.
ACM Trans. Comput. Log., 2014

RPO semantics for mobile ambients.
Mathematical Structures in Computer Science, 2014

A Virtual Experience on the Very First Italian Computer.
JOCCH, 2014

Encoding Synchronous Interactions Using Labelled Petri Nets.
Proceedings of the Coordination Models and Languages, 2014

2013
Preface.
J. Vis. Lang. Comput., 2013

Adaptation is a Game.
TinyToCS, 2013

Soft Constraints for Lexicographic Orders.
Proceedings of the Advances in Artificial Intelligence and Its Applications, 2013

Validating reconfigurations of reo circuits in an e-Banking scenario.
Proceedings of the 4th international ACM Sigsoft symposium on Architecting critical systems, 2013

Using Old Computers for Teaching Computer Science.
Proceedings of the Making the History of Computing Relevant, 2013

2012
A Presheaf Environment for the Explicit Fusion Calculus.
J. Autom. Reasoning, 2012

Counterpart Semantics for a Second-Order μ-Calculus.
Fundam. Inform., 2012

Local arc consistency for non-invertible semirings, with an application to multi-objective optimization.
Expert Syst. Appl., 2012

Modelling and Analyzing Adaptive Self-assembly Strategies with Maude.
Proceedings of the Rewriting Logic and Its Applications - 9th International Workshop, 2012

Barbed Semantics for Open Reactive Systems.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2012

Adaptable Transition Systems.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2012

A Modular LTS for Open Reactive Systems.
Proceedings of the Theoretical Computer Science, 2012

Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models.
Proceedings of the Graph Transformations - 6th International Conference, 2012

A Conceptual Framework for Adaptation.
Proceedings of the Fundamental Approaches to Software Engineering, 2012

2011
A decentralised graphical implementation of mobile ambients.
J. Log. Algebr. Program., 2011

Preface.
ECEASST, 2011

Adhesivity Is Not Enough: Local Church-Rosser Revisited.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Towards a General Theory of Barbs, Contexts and Labels.
Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

Hierarchical Models for Service-Oriented Systems.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

2010
From Petri Nets to Graph Transformation Systems.
ECEASST, 2010

An Algebra of Hierarchical Graphs and its Application to Structural Encoding.
Sci. Ann. Comp. Sci., 2010

An Institution for Graph Transformation.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2010

An Algebra of Hierarchical Graphs.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Extending Soft Arc Consistency Algorithms to Non-invertible Semirings.
Proceedings of the Advances in Artificial Intelligence, 2010

Counterpart Semantics for a Second-Order µ-Calculus.
Proceedings of the Graph Transformations - 5th International Conference, 2010

Saturated LTSs for Adhesive Rewriting Systems.
Proceedings of the Graph Transformations - 5th International Conference, 2010

On GS-Monoidal Theories for Graphs with Nesting.
Proceedings of the Graph Transformations and Model-Driven Engineering, 2010

Concurrency Can't Be Observed, Asynchronously.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Synthesising CCS bisimulation using graph rewriting.
Inf. Comput., 2009

A Net-based Approach to Web Services Publication and Replaceability.
Fundam. Inform., 2009

A Note on an Old-Fashioned Algebra for (Disconnected) Graphs.
Electr. Notes Theor. Comput. Sci., 2009

Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding).
Electr. Notes Theor. Comput. Sci., 2009

Preface.
Electr. Notes Theor. Comput. Sci., 2009

On Barbs and Labels in Reactive Systems
Proceedings of the Proceedings Sixth Workshop on Structural Operational Semantics, 2009

A Graph Syntax for Processes and Services.
Proceedings of the Web Services and Formal Methods, 6th International Workshop, 2009

Reactive Systems, Barbed Semantics, and the Mobile Ambients.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Encoding Asynchronous Interactions Using Open Petri Nets.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
On the Use of Behavioural Equivalences for Web Services' Development.
Fundam. Inform., 2008

A Calculus for Team Automata.
Electr. Notes Theor. Comput. Sci., 2008

Towards a Notion of Transaction in Graph Rewriting.
Electr. Notes Theor. Comput. Sci., 2008

A Term-Graph Syntax for Algebras over Multisets.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2008

A Soft Approach to Multi-objective Optimization.
Proceedings of the Logic Programming, 24th International Conference, 2008

A Decentralized Implementation of Mobile Ambients.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Parallel and Sequential Independence for Borrowed Contexts.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Ugo Montanari and Friends.
Proceedings of the Concurrency, 2008

A Category of Explicit Fusions.
Proceedings of the Concurrency, 2008

Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

Petri Nets Are Dioids.
Proceedings of the Algebraic Methodology and Software Technology, 2008

2007
Graph rewriting for the pi-calculus.
Mathematical Structures in Computer Science, 2007

Inequational Deduction as Term Graph Rewriting.
Electr. Notes Theor. Comput. Sci., 2007

Preface.
Electr. Notes Theor. Comput. Sci., 2007

Modelling Calculi with Name Mobility using Graphs with Equivalences.
Electr. Notes Theor. Comput. Sci., 2007

A Behavioural Congruence for Web Services.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

Graphical Encoding of a Spatial Logic for the pi -Calculus.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Processes as formal power series: A coinductive approach to denotational semantics.
Theor. Comput. Sci., 2006

About permutation algebras, (pre)sheaves and named sets.
Higher-Order and Symbolic Computation, 2006

Graphical Verification of a Spatial Logic for the pi-calculus.
Electr. Notes Theor. Comput. Sci., 2006

Preface.
Electr. Notes Theor. Comput. Sci., 2006

Process Bisimulation Via a Graphical Encoding.
Proceedings of the Graph Transformations, Third International Conference, 2006

Graph Transactions as Processes.
Proceedings of the Graph Transformations, Third International Conference, 2006

Enhancing Constraints Manipulation in Semiring-Based Formalisms.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Concurrent Rewriting for Graphs with Equivalences.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
On Term Graphs as an Adhesive Category.
Electr. Notes Theor. Comput. Sci., 2005

Deriving Weak Bisimulation Congruences from Reduction Systems.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes.
Proceedings of the Processes, 2005

Graph Processes with Fusions: Concurrency by Colimits, Again.
Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004
Some Characterization Results for Permutation Algebras.
Electr. Notes Theor. Comput. Sci., 2004

Specifying and Verifying UML Activity Diagrams Via Graph Transformation.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

2003
Denotational Testing Semantics in Coinductive Form.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Causality and Replication in Concurrent Processes.
Proceedings of the Perspectives of Systems Informatics, 2003

Term Graph Rewriting for the pi-Calculus.
Proceedings of the Programming Languages and Systems, First Asian Symposium, 2003

2002
Comparing logics for rewriting: rewriting logic, action calculi and tile logic.
Theor. Comput. Sci., 2002

A causal semantics for CCS via rewriting logic.
Theor. Comput. Sci., 2002

A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
Theor. Comput. Sci., 2002

Normal forms for algebras of connection.
Theor. Comput. Sci., 2002

Preface - WRLA 2002, Rewriting Logic and Its Applications, Pisa, Italy, 19-21 September 2002.
Electr. Notes Theor. Comput. Sci., 2002

GS.Lambda Theories: A Syntax for Higher-Order Graphs.
Electr. Notes Theor. Comput. Sci., 2002


2001
A Concurrent Graph Semantics for Mobile Ambients.
Electr. Notes Theor. Comput. Sci., 2001

Comparing cospan-spans and tiles via a Hoare-style process calculus.
Electr. Notes Theor. Comput. Sci., 2001

Categorical rewriting of term-like structures.
Electr. Notes Theor. Comput. Sci., 2001

Some algebraic laws for spans.
Electr. Notes Theor. Comput. Sci., 2001

2000
The tile model.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting.
Electr. Notes Theor. Comput. Sci., 1999

Rewriting on cyclic structures: Equivalence between the operational and the categorical description.
ITA, 1999

An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories.
Applied Categorical Structures, 1999

1998
CCS semantics via proved transition systems and rewriting logic.
Electr. Notes Theor. Comput. Sci., 1998

Functorial Semantics for Multi-algebras.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

Normal Forms for Partitions and Relations.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

A Fully Abstract Model for Graph-Interpreted Temporal Logic.
Proceedings of the Theory and Application of Graph Transformations, 1998

Axioms for Contextual Net Processes.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Rational Term Rewriting.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
An inductive view of graph transformation.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

A 2-Categorical Presentation of Term Graph Rewriting.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996
Tiles, rewriting rules and CCS.
Electr. Notes Theor. Comput. Sci., 1996

1995
Relating Two Categorial Models of Term Rewriting.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Modal mu-Types for Processes
Proceedings of the Proceedings, 1995

CPO Models for Infinite Term Rewriting.
Proceedings of the Algebraic Methodology and Software Technology, 1995


  Loading...