Paolo Baldan

According to our database1, Paolo Baldan authored at least 117 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Fixpoint games on continuous lattices.
PACMPL, 2019

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

2018
Multilevel transitive and intransitive non-interference, causally.
Theor. Comput. Sci., 2018

Many-to-many information flow policies.
Sci. Comput. Program., 2018

Coalgebraic Behavioral Metrics.
Logical Methods in Computer Science, 2018

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

Petri Nets for Modelling and Analysing Trophic Networks.
Fundam. Inform., 2018

Fixpoint Games on Continuous Lattices.
CoRR, 2018

Event Structures for Petri nets with Persistence.
CoRR, 2018

Automata for True Concurrency Properties.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Preface.
Inf. Comput., 2017

Coalgebraic Behavioral Metrics.
CoRR, 2017

Domains and Event Structures for Fusions.
CoRR, 2017

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

Local Model Checking in a Logic for True Concurrency.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Many-to-Many Information Flow Policies.
Proceedings of the Coordination Models and Languages, 2017

2016
Reduction of event structures under history preserving bisimulation.
J. Log. Algebr. Meth. Program., 2016

Diagnosing behavioral differences between business process models: An approach based on event structures.
Inf. Syst., 2016

Multilevel Transitive and Intransitive Non-interference, Causally.
Proceedings of the Coordination Models and Languages, 2016

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

A Causal View on Non-Interference.
Fundam. Inform., 2015

Towards Trace Metrics via Functor Lifting.
CoRR, 2015

Towards Trace Metrics via Functor Lifting.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

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

Petri nets for modelling and analysing trophic networks.
Proceedings of the 6th International Workshop on Biological Processes & Petri Nets co-located with 36th International Conference on Application and Theory of Petri Nets and Concurreny (PETRI NETS 2015), 2015

2014
Processes and unfoldings: concurrent computations in adhesive categories.
Mathematical Structures in Computer Science, 2014

A Logic for True Concurrency.
J. ACM, 2014

Behavioral Metrics via Functor Lifting.
CoRR, 2014

Reduction of Event Structures under History Preserving Bisimulation.
CoRR, 2014

Behavioral Metrics via Functor Lifting.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Intransitive Non-Interference by Unfolding.
Proceedings of the Formal Aspects of Component Software - 11th International Symposium, 2014

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

BP-Diff: A Tool for Behavioral Comparison of Business Process Models.
Proceedings of the BPM Demo Sessions 2014 Co-located with the 12th International Conference on Business Process Management (BPM 2014), 2014

Behavioral Comparison of Process Models Based on Canonically Reduced Event Structures.
Proceedings of the Business Process Management - 12th International Conference, 2014

Non-interference by Unfolding.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

Hereditary History-Preserving Bisimilarity: Logics and Automata.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
Comparing Metabolic Pathways through Reactions and Potential Fluxes.
Trans. Petri Nets and Other Models of Concurrency, 2013

Representing and Comparing Metabolic Pathways as Petri Nets with MPath2PN and CoMeta.
Electr. Notes Theor. Comput. Sci., 2013

Comparing metabolic pathways through potential fluxes: a selective opening approach.
Proceedings of the International Workshop on Biological Processes & Petri Nets, 2013

2012
Efficient unfolding of contextual Petri nets.
Theor. Comput. Sci., 2012

2011
A lattice-theoretical perspective on adhesive categories.
J. Symb. Comput., 2011

A Logic for True Concurrency
CoRR, 2011

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

Efficient Contextual Unfolding.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Petri nets for modelling metabolic pathways: a survey.
Natural Computing, 2010

Unfolding-based diagnosis of systems with an evolving topology.
Inf. Comput., 2010

From Petri Nets to Graph Transformation Systems.
ECEASST, 2010

Sharing in the Graph Rewriting Calculus.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2010

On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars.
Proceedings of the Graph Transformations - 5th International Conference, 2010

A Logic for True Concurrency.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

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

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

Unfolding Grammars in Adhesive Categories.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
McMillan's Complete Prefix for Contextual Nets.
Trans. Petri Nets and Other Models of Concurrency, 2008

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.
Logical Methods in Computer Science, 2008

A framework for the verification of infinite-state graph transformation systems.
Inf. Comput., 2008

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

Towards a Sharing Strategy for the Graph Rewriting Calculus.
Electr. Notes Theor. Comput. Sci., 2008

Preface.
ECEASST, 2008

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
CoRR, 2008

Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Workshop on Petri Nets and Graph Transformations.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Open Petri Nets: Non-deterministic Processes and Compositionality.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Unfolding-Based Diagnosis of Systems with an Evolving Topology.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Unfolding Graph Transformation Systems: Theory and Applications to Verification.
Proceedings of the Concurrency, 2008

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

2007
A semantic framework for open processes.
Theor. Comput. Sci., 2007

A rewriting calculus for cyclic higher-order term graphs.
Mathematical Structures in Computer Science, 2007

Unfolding semantics of graph transformation.
Inf. Comput., 2007

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

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

Deducing Interactions in Partially Unspecified Biological Systems.
Proceedings of the Algebraic Biology, Second International Conference, 2007

2006
Foreword.
ECEASST, 2006

A Temporal Graph Logic for Verification of Graph Transformation Systems.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2006

Workshop on Petri Nets and Graph Transformations.
Proceedings of the Graph Transformations, Third International Conference, 2006

Composition and Decomposition of DPO Transformations with Borrowed Context.
Proceedings of the Graph Transformations, Third International Conference, 2006

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

Distributed Unfolding of Petri Nets.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Processes for Adhesive Rewriting Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

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

2005
Compositional semantics for open Petri nets based on deterministic processe.
Mathematical Structures in Computer Science, 2005

A Rewriting Calculus for Cyclic Higher-order Term Graphs.
Electr. Notes Theor. Comput. Sci., 2005

Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs.
Electr. Notes Theor. Comput. Sci., 2005

On the Concurrent Semantics of Algebraic Graph Grammars.
Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004
Domain and event structure semantics for Petri nets with read and inhibitor arcs.
Theor. Comput. Sci., 2004

Verifying a Behavioural Logic for Graph Transformation Systems.
Electr. Notes Theor. Comput. Sci., 2004

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems.
Proceedings of the Graph Transformations, Second International Conference, 2004

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

Symbolic Equivalences for Open Systems.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

Summary 2: Graph Grammar Verification through Abstraction.
Proceedings of the Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
A category of compositional domain-models for separable Stone spaces.
Theor. Comput. Sci., 2003

A Logic for Analyzing Abstractions of Graph Transformation Systems.
Proceedings of the Static Analysis, 10th International Symposium, 2003

2002
Coreflective Concurrent Semantics for Single-Pushout Graph Grammars.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2002

Pre-nets, Read Arcs and Unfolding: A Functorial Presentation.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2002


Approximating the Behaviour of Graph Transformation Systems.
Proceedings of the Graph Transformation, First International Conference, 2002

High-Level Net Processes.
Proceedings of the Formal and Natural Computing, 2002

MuTACLP: A Language for Temporal Reasoning with Multiple Theories.
Proceedings of the Computational Logic: Logic Programming and Beyond, 2002

Bisimulation Equivalences for Graph Grammars.
Proceedings of the Formal and Natural Computing, 2002

Bisimulation by Unification.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Contextual Petri Nets, Asymmetric Event Structures, and Processes.
Inf. Comput., 2001

Concurrency for Graph Grammars in a Petri net shell.
Electr. Notes Theor. Comput. Sci., 2001

A Static Analysis Technique for Graph Transformation Systems.
Proceedings of the CONCUR 2001, 2001

Compositional Modeling of Reactive Systems Using Open Nets.
Proceedings of the CONCUR 2001, 2001

2000
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs.
Proceedings of the CONCUR 2000, 2000

1999
Basic Theory of F-Bounded Quantification.
Inf. Comput., 1999

History Preserving Bisimulation for Contextual Nets.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1999

Unfolding and Event Structure Semantics for Graph Grammars.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998
A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space.
Theor. Comput. Sci., 1998

Unfolding of Double-Pushout Graph Grammars is a Coreflection.
Proceedings of the Theory and Application of Graph Transformations, 1998

Concatenable Graph Processes: Relating Processes and Derivation Traces.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
Partializing Stone Spaces using SFP Domains (Extended Abstract).
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995
A Fixed-Point Theorem in a Category of Compact Metric Spaces.
Theor. Comput. Sci., 1995

Solutions of functorial and non-functorial metric domain equations.
Electr. Notes Theor. Comput. Sci., 1995


  Loading...