Ugo Montanari

According to our database1, Ugo Montanari
  • authored at least 332 papers between 1968 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Models of Computation
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-319-42900-7, 2017

Asynchronous Distributed Execution Of Fixpoint-Based Computational Fields.
Logical Methods in Computer Science, 2017

2016
Hartmut Ehrig (1944-2016).
Bulletin of the EATCS, 2016

2015
From Local to Global Knowledge and Back.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

The E-mobility Case Study.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

Reconfigurable and Software-Defined Networks of Connectors and Components.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

Tools for Ensemble Design and Runtime.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

Constraint design rewriting.
Sci. Comput. Program., 2015

cJoin: Join with communicating transactions.
Mathematical Structures in Computer Science, 2015

A coalgebraic semantics for causality in Petri nets.
J. Log. Algebr. Meth. Program., 2015

Network-Conscious π-calculus - A Model of Pastry.
Electr. Notes Theor. Comput. Sci., 2015

Dynamic Programming on Nominal Graphs.
Proceedings of the Proceedings Graphs as Models, 2015

A coalgebraic semantics for causality in Petri nets.
CoRR, 2015

Revisiting causality, coalgebraically.
Acta Inf., 2015

A Fixpoint-Based Calculus for Graph-Shaped Computational Fields.
Proceedings of the Coordination Models and Languages, 2015

Programming Autonomic Systems with Multiple Constraint Stores.
Proceedings of the Software, 2015

Causal Trees, Finally.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

A Normal Form for Stateful Connectors.
Proceedings of the Logic, Rewriting, and Concurrency, 2015

2014
A network-conscious π-calculus and its coalgebraic semantics.
Theor. Comput. Sci., 2014

Foreword: special issue on structure transformation.
Mathematical Structures in Computer Science, 2014

On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs.
Fundam. Inform., 2014

Prosumers as Aggregators in the DEZENT Context of Regenerative Power Production.
Proceedings of the Eighth IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2014

From Hierarchical BIP to Petri Calculus.
Proceedings of the From Programs to Systems. The Systems perspective in Computing, 2014

Behaviour, Interaction and Dynamics.
Proceedings of the Specification, Algebra, and Software, 2014

2013
Connector algebras for C/E and P/T nets' interactions.
Logical Methods in Computer Science, 2013

A Life Cycle for the Development of Autonomic Systems: The E-mobility Showcase.
Proceedings of the 7th IEEE International Conference on Self-Adaptation and Self-Organizing Systems Workshops, 2013

Real time market models and prosumer profiling.
Proceedings of the 2013 Proceedings IEEE INFOCOM Workshops, 2013

Real time market models and prosumer profiling.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012
A Game-Theoretic Analysis of Grid Job Scheduling.
J. Grid Comput., 2012

Network Conscious π-calculus: A Concurrent Semantics.
Electr. Notes Theor. Comput. Sci., 2012

Soft Constraint Logic Programming for Electric Vehicle Travel Optimization
CoRR, 2012

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

Soft constraints for KnowLang.
Proceedings of the Fifth International C* Conference on Computer Science & Software Engineering, 2012

2011
QoS negotiation in service composition.
J. Log. Algebr. Program., 2011

On Structured Model-Driven Transformations.
Int. J. Software and Informatics, 2011

Symbolic and Asynchronous Semantics via Normalized Coalgebras
Logical Methods in Computer Science, 2011

Constraints for Service Contracts.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

A Survey on Basic Connectors and Buffers.
Proceedings of the Formal Methods for Components and Objects, 10th International Symposium, 2011

Connector Algebras, Petri Nets, and BIP.
Proceedings of the Perspectives of Systems Informatics, 2011

A Connector Algebra for P/T Nets Interactions.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

A Unifying Formal Basis for the Sensoria Approach: A White Paper.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

CC-Pi: A Constraint Language for Service Negotiation and Composition.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

A Formal Support to Business and Architectural Design for Service-Oriented Systems.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

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

2010
Unicast and multicast QoS routing with soft-constraint logic programming.
ACM Trans. Comput. Log., 2010

Symmetries, local names and dynamic (de)-allocation of names.
Inf. Comput., 2010

Families of Symmetries as Efficient Models of Resource Binding.
Electr. Notes Theor. Comput. Sci., 2010

Modeling a Service and Session Calculus with Hierarchical Graph Transformation.
ECEASST, 2010

From Petri Nets to Graph Transformation Systems.
ECEASST, 2010

Toward a Game-Theoretic Model of Grid Systems.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

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

Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning.
Proceedings of the Formal Techniques for Distributed Systems, 2010

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

2009
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves.
Theor. Comput. Sci., 2009

Hierarchical Design Rewriting with Maude.
Electr. Notes Theor. Comput. Sci., 2009

A Service-Oriented UML Profile with Formal Support.
Proceedings of the Service-Oriented Computing, 7th International Joint Conference, 2009

Minimization Algorithm for Symbolic Bisimilarity.
Proceedings of the Programming Languages and Systems, 2009

Coalgebraic Symbolic Semantics.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Preface.
Theor. Comput. Sci., 2008

A Name Abstraction Functor for Named Sets.
Electr. Notes Theor. Comput. Sci., 2008

A Coalgebraic Theory of Reactive Systems.
Electr. Notes Theor. Comput. Sci., 2008

G-Reactive Systems as Coalgebras.
Electr. Notes Theor. Comput. Sci., 2008

Style-Based Architectural Reconfigurations.
Bulletin of the EATCS, 2008

A survey of constraint-based programming paradigms.
Computer Science Review, 2008

Tiles for Reo.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2008

Symbolic Semantics Revisited.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Open Bisimulation for the Concurrent Constraint Pi-Calculus.
Proceedings of the Programming Languages and Systems, 2008

2007
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming.
TPLP, 2007

A compositional coalgebraic model of fusion calculus.
J. Log. Algebr. Program., 2007

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

Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming.
Electr. Notes Theor. Comput. Sci., 2007

Prototype Platforms for Distributed Agreements.
Electr. Notes Theor. Comput. Sci., 2007

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

Unicast and Multicast Qos Routing with Soft Constraint Logic Programming
CoRR, 2007

Service Oriented Architectural Design.
Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Constraint-Based Policy Negotiation and Enforcement for Telco Services.
Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, 2007

CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements.
Proceedings of the Programming Languages and Systems, 2007

Coalgebraic Models for Reactive Systems.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Foreword.
Proceedings of the Handbook of Constraint Programming, 2006

Soft concurrent constraint programming.
ACM Trans. Comput. Log., 2006

A basic algebra of stateless connectors.
Theor. Comput. Sci., 2006

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

Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility.
Electr. Notes Theor. Comput. Sci., 2006

A Compositional Coalgebraic Model of a Fragment of Fusion Calculus.
Electr. Notes Theor. Comput. Sci., 2006

Event Structure Semantics for Dynamic Graph Grammars.
ECEASST, 2006

SCC: A Service Centered Calculus.
Proceedings of the Web Services and Formal Methods, Third International Workshop, 2006

Saturated Semantics for Reactive Systems.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Event Structure Semantics for Nominal Calculi.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

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

2005
Structured coalgebras and minimal HD-automata for the pi-calculus.
Theor. Comput. Sci., 2005

Quantitative mu-calculus and CTL defined over constraint semirings.
Theor. Comput. Sci., 2005

Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types.
Theor. Comput. Sci., 2005

Observational congruences for dynamically reconfigurable tile systems.
Theor. Comput. Sci., 2005

Quantitative ?-calculus and CTL Based on Constraint Semirings.
Electr. Notes Theor. Comput. Sci., 2005

Synchronization Algebras with Mobility for Graph Transformations.
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

Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming
CoRR, 2005

A General Name Binding Mechanism.
Proceedings of the Trustworthy Global Computing, International Symposium, 2005

History-Dependent Automata: An Introduction.
Proceedings of the Formal Methods for Mobile Computing, 2005

Theoretical foundations for compensations in flow composition languages.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

Model Checking for Nominal Calculi.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Synchronised Hyperedge Replacement as a Model for Service Oriented Computing.
Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005

From Theory to Practice in Transactional Composition of Web Services.
Proceedings of the Formal Techniques for Computer Systems and Business Processes, 2005

Insights emerged while comparing three models for global computing.
Proceedings of the Foundations of Global Computing, 20.-25. February 2005, 2005

05081 Abstracts Collection - Foundations of Global Computing.
Proceedings of the Foundations of Global Computing, 20.-25. February 2005, 2005

A Process Calculus for QoS-Aware Applications.
Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

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

Comparing Two Approaches to Compensable Flow Composition.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Modelling Fusion Calculus using HD-Automata.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

Complete Axioms for Stateless Connectors.
Proceedings of the Algebra and Coalgebra in Computer Science: First 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
Concurrent models for Linda with transactions.
Mathematical Structures in Computer Science, 2004

Web Services and Models of Computation.
Electr. Notes Theor. Comput. Sci., 2004

A Graphical Fusion Calculus.
Electr. Notes Theor. Comput. Sci., 2004

Shaped Hierarchical Architectural Design.
Electr. Notes Theor. Comput. Sci., 2004

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

Flat Committed Join in Join.
Electr. Notes Theor. Comput. Sci., 2004

Verication On The Web Of Mobile Systems.
Proceedings of the Verification and Validation of Enterprise Information Systems, 2004

Nested Commits for Mobile Calculi: Extending Join.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

New Insights on Architectural Connectors.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems.
Proceedings of the Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004

D-Fusion: A Distinctive Fusion Calculus.
Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2003
A model-checking verification environment for mobile processes.
ACM Trans. Softw. Eng. Methodol., 2003

Algebraic Theories for Contextual Pre-nets.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

A Formal Basis for Reasoning on Programmable QoS.
Proceedings of the Verification: Theory and Practice, 2003

Extending the Zero-Safe Approach to Coloured, Reconfigurable and Dynamic Nets.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

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

Compositional SOS and beyond: a coalgebraic view of open systems.
Theor. Comput. Sci., 2002

Dynamic connectors for concurrency.
Theor. Comput. Sci., 2002

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

Symmetric Monoidal and Cartesian Double Categories as a Semantic Framework for Tile Logic.
Mathematical Structures in Computer Science, 2002

Soft Constraint Logic Programming and Generalized Shortest Path Problems.
J. Heuristics, 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

Tiling Transactions in Rewriting Logic.
Electr. Notes Theor. Comput. Sci., 2002

Soft Concurrent Constraint Programming
CoRR, 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


Graph-Based Models of Internetworking Systems.
Proceedings of the Formal Methods at the Crossroads. From Panacea to Foundational Support, 2002

Linear Ordered Graph Grammars and Their Algebraic Foundations.
Proceedings of the Graph Transformation, First International Conference, 2002

Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

From Co-algebraic Specifications to Implementation: The Mihda Toolkit.
Proceedings of the Formal Methods for Components and Objects, 2002

Soft Concurrent Constraint Programming.
Proceedings of the Programming Languages and Systems, 2002

A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence.
Proceedings of the CONCUR 2002, 2002

Orchestrating Transactions in Join Calculus.
Proceedings of the CONCUR 2002, 2002

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

2001
An interactive semantics of logic programming.
TPLP, 2001

Semiring-based contstraint logic programming: syntax and semantics.
ACM Trans. Program. Lang. Syst., 2001

Functorial Models for Petri Nets.
Inf. Comput., 2001

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

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

Two Graph-Based Techniques for Software Architecture Reconfiguration.
Electr. Notes Theor. Comput. Sci., 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

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

Zero-safe net models for transactions in Linda.
Electr. Notes Theor. Comput. Sci., 2001

An interactive semantics of logic programming
CoRR, 2001

Observational Equivalence for Synchronized Graph Rewriting with Mobility.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

A LTS Semantics of Ambients via Graph Synchronization with Mobility.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Synchronized Hyperedge Replacement with Name Mobility.
Proceedings of the CONCUR 2001, 2001

Transactions and Zero-Safe Nets.
Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001

2000
Tile Formats for Located and Mobile Systems.
Inf. Comput., 2000

Zero-Safe Nets: Comparing the Collective and Individual Token Approaches.
Inf. Comput., 2000

pi-Calculus, Structured Coalgebras, and Minimal HD-Automata.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Two Problems in Wide Area Network Programming.
Proceedings of the Theoretical Computer Science, 2000

Open Ended Systems, Dynamic Bisimulation and Tile Logic.
Proceedings of the Theoretical Computer Science, 2000

Graphical Operational Semantics.
ICALP Satellite Workshops, 2000

Reconfiguration of Software Architecture Styles with Name Mobility.
Proceedings of the Coordination Languages and Models, 4th International Conference, 2000

Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic.
Proceedings of the CONCUR 2000, 2000

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

Executing Transactions in Zero-Safe Nets.
ICATPN, 2000

1999
Functorial semantics for Petri nets under the individual token philosophy.
Electr. Notes Theor. Comput. Sci., 1999

Consistent transformations for software architecture styles of distributed systems.
Electr. Notes Theor. Comput. Sci., 1999

From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence.
Electr. Notes Theor. Comput. Sci., 1999

Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison.
Constraints, 1999

Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems.
Applied Categorical Structures, 1999

Modeling Software Architecutes and Styles with Graph Grammars and Constraint Solving.
Proceedings of the Software Architecture, 1999

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

Finite State Verification for the Asynchronous pi-Calculus.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1999

Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

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

Tile Transition Systems as Structured Coalgebras.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Executable Tile Specifications for Process Calculi.
Proceedings of the Fundamental Approaches to Software Engineering, 1999

1998
Partial Order and Contextual Net Semantics for Atomic and Locally Atomic CC Programs.
Sci. Comput. Program., 1998

Parameterized Structured Operational Semantics.
Fundam. Inform., 1998

Internal strategies in a rewriting implementation of tile systems.
Electr. Notes Theor. Comput. Sci., 1998

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

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

Final semantics for the pi-calculus.
Proceedings of the Programming Concepts and Methods, 1998

Axioms for Contextual Net Processes.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 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

Verifying Mobile Processes in the HAL Environment.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

A Comparison of Petri Net Semantics under the Collective Token Philosophy.
Proceedings of the Advances in Computing Science, 1998

1997
On the Semantics of Place/Transition Petri Nets.
Mathematical Structures in Computer Science, 1997

Structured Transition Systems with Parametric Observations: Observational Congruences and Minimal Realizations.
Mathematical Structures in Computer Science, 1997

Semiring-based constraint satisfaction and optimization.
J. ACM, 1997

A Concurrent Functional Semantics for a Process Algebra Based on Action Systems.
Fundam. Inform., 1997

Can Actors and pi-Agents Live Together?
Electr. Notes Theor. Comput. Sci., 1997

An Introduction to History Dependent Automata.
Electr. Notes Theor. Comput. Sci., 1997

Tiles for concurrent and located calculi?
Electr. Notes Theor. Comput. Sci., 1997

Zero-safe nets, or transition synchronization made simple.
Electr. Notes Theor. Comput. Sci., 1997

Constraint Solving and Programming: What Next?
Constraints, 1997

Mapping tile logic into rewriting logic.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

Zero-safe nets: The individual token approach.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

An Automated Based Verification Environment for Mobile Processes.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1997

Minimal Transition Systems for History-Preserving Bisimulation.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

A Tile-Based Coordination View of Asynchronous pi-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Semiring-based Constraint Logic Programming.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach.
Proceedings of the Handbook of Graph Grammars and Computing by Graph Transformations, 1997

Representation Theorems for Petri Nets.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
Process versus Unfolding Semantics for Place/Transition Petri Nets.
Theor. Comput. Sci., 1996

A Pi-Calculus with Explicit Substitutions.
Theor. Comput. Sci., 1996

Axiomatizing Permutation Equivalence.
Mathematical Structures in Computer Science, 1996

Graph Processes.
Fundam. Inform., 1996

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

Constraint Solving and Programming: What's Next?
ACM Comput. Surv., 1996

Causal Computing.
ACM Comput. Surv., 1996

Axiomatizing the Algebra of Net Computations and Processes.
Acta Inf., 1996

Efficient Minimization up to Location Equivalence.
Proceedings of the Programming Languages and Systems, 1996

History dependent verification for partial order systems.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization (Extended Abstract).
Proceedings of the Coordination Languages and Models, First International Conference, 1996

1995
Location Equivalence in Parametric Setting.
Theor. Comput. Sci., 1995

On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies.
Theor. Comput. Sci., 1995

Concurrent semantics for the pi-calculus.
Electr. Notes Theor. Comput. Sci., 1995

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

Contextual Nets.
Acta Inf., 1995

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

Constraint Solving over Semirings.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison.
Proceedings of the Over-Constrained Systems, 1995

Checking Bisimilarity for Finitary pi-Calculus.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

The Weak Late pi-Calculus Semantics as Observation Equivalence.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

Dynamic Matrices and the Cost Analysis of Concurrent Programs.
Proceedings of the Algebraic Methodology and Software Technology, 1995

1994
An Abstract Machine for Concurrent Modular Systems: CHARM.
Theor. Comput. Sci., 1994

Concurrency and Concurrent Constraint Programming
Proceedings of the Constraint Programming: Basics and Trends, Châtillon Spring School, 1994

Combining CCS and Petri Nets Via Structural Axioms.
Fundam. Inform., 1994

An Event Structure Semantics for Graph Grammars with Parallel Productions.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

The Category of Typed Graph Grammars and its Adjunctions with Categories.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Modelling Concurrent Accesses to Shared Data via Petri Nets.
Proceedings of the Programming Concepts, 1994

An Event Structure Semantics for Safe Graph Grammars.
Proceedings of the Programming Concepts, 1994

CC Programs with both In- and Non-determinism: A Concurrent Semantics.
Proceedings of the Principles and Practice of Constraint Programming, 1994

Towards a Concurrent Semantics based Analysis of CC and CLP.
Proceedings of the Principles and Practice of Constraint Programming, 1994

A Pi-Calculus with Explicit Substitutions: the Late Semantics.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

On the Model of Computation of Place/Transition Petri Nets.
Proceedings of the Application and Theory of Petri Nets 1994, 1994

From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics.
Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1993
Graph Rewriting for a Partial Ordering Semantics of Concurrent Constraint Programming.
Theor. Comput. Sci., 1993

Universal Axioms for Bisimulations.
Theor. Comput. Sci., 1993

Axiomatizing CCS, Nets and Processes.
Sci. Comput. Program., 1993

Constraint Satisfaction, Constraint Programming, and Concurrency.
PPCP, 1993

Contextual Nets and Constraint Logic Programming.
Proceedings of the ICLP'93 Post-Conference Workshop on Concurrent Constraint Programming, 1993

Contextual Occurence Nets and Concurrent Constraint Programming.
Proceedings of the Graph Transformations in Computer Science, International Workshop, 1993

Jungle Rewriting: an Abstract Description of a Lazy Narrowing Machine.
Proceedings of the Graph Transformations in Computer Science, International Workshop, 1993

Abstract Graph Derivations in the Double Pushout Approach.
Proceedings of the Graph Transformations in Computer Science, International Workshop, 1993

1992
An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs.
Theor. Comput. Sci., 1992

Dynamic congruence vs. progressing bisimulation for CCS.
Fundam. Inform., 1992

Observation Trees.
Proceedings of the NAPAW 92, 1992

True Concurrency: Theory and Practice.
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, U.K., June 29, 1992

Mobility in the CC-Paradigm.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

A Parametric Approach to Localities.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

SHARM: Concurrency and Hiding in an Abstract Rewriting Machine.
FGCS, 1992

On the Semantics of Petri Nets.
Proceedings of the CONCUR '92, 1992

Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering Semantics.
Proceedings of the CAAP '92, 1992

Axiomatizing Permutation Equivalence in the Lambda-Calculus.
Proceedings of the Algebraic and Logic Programming, 1992

1991
Constraint Relaxation may be Perfect.
Artif. Intell., 1991

Finite Domain Constraint Solving and Constraint Logic Programming.
WCLP, 1991

An Extended Expansion Theorem.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

True Concurrency in Concurrent Constraint Programming.
Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

CCS Dynamic Bisimulation is Progressing.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Perfect Relaxation in Constraint Logic Programming.
Proceedings of the Logic Programming, 1991

An Algebra of Graphs and Graph Rewriting.
Proceedings of the Category Theory and Computer Science, 1991

The Observation Algebra of Spatial Pomsets.
Proceedings of the CONCUR '91, 1991

An Algebraic Representation of Logic-Program Computations.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

Distributed Implementation of CCS.
Proceedings of the Advances in Petri Nets 1993, 1991

1990
Petri Nets Are Monoids
Inf. Comput., October, 1990

A2CCKS: Atomic Actions for CCS.
Theor. Comput. Sci., 1990

A Partial Ordering Semantics for CCS.
Theor. Comput. Sci., 1990

Towards Hierarchical Description of Systems: A Proof System for Strong Prefixing.
Int. J. Found. Comput. Sci., 1990

Towards a Process Semantics in the Logic Programming Style.
Proceedings of the STACS 90, 1990

An Algebraic Semantics of Logic Programs as Structured Transition Systems.
Proceedings of the Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, USA, October 29, 1990

Transition Systems with Algebraic Structure as Models of Computations.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Graph Grammars and Logic Programming.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

Back and Forth Bisimulations.
Proceedings of the CONCUR '90, 1990

SCONE: A Simple Calculus of Nets.
Proceedings of the CONCUR '90, 1990

Towards the Unification of Models for Concurrency.
Proceedings of the CAAP '90, 1990

1989
Axiomatizing Net Computations and Processes
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Exact Solution in Linear Time of Networks of Constraints Using Perfect Relaxation.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

An Algebraic View of Interleaving and Distributed Operational Semantics for CCS.
Proceedings of the Category Theory and Computer Science, 1989

1988
A Distributed Operational Semantics for CCS Based on Condition/Event Systems.
Acta Inf., 1988

Partial orderings descriptions and observations of nondeterministic concurrent processes.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

Hypergraph Grammars and Networks of Constraints versus Logic Programming and Metaprogramming.
META, 1988

Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

On the Consistency of "Truly Concurrent" Operational and Denotational Semantics (Extended Abstract)
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

A²CCS: A Simple Extension of CCS for Handling Atomic Actions.
Proceedings of the CAAP '88, 1988

CEDISYS: Compositional Distributed Systems - State of the art, research goals, references.
Proceedings of the Advances in Petri Nets 1989, 1988

1987
Concurrent Histories: A Basis for Observing Distributed Systems.
J. Comput. Syst. Sci., 1987

A model for distributed systems based on graph rewriting.
J. ACM, 1987

An Executon Environment for the Formal Definiton of Ada.
Proceedings of the ESEC '87, 1987

1986
Graph rewriting with unification and composition.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

CCS is an (Augmented) Contact Free C/E System.
Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

1985
Specification Languages for Distributed Systems.
Proceedings of the Mathematical Foundations of Software Development, 1985

Partial ordering derivations for CCS.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Liveness Properties as Convergence in Metric Spaces
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1982
An Efficient Unification Algorithm.
ACM Trans. Program. Lang. Syst., 1982

Graph Grammars for distributed systems.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

1981
Dynamic Programming as Graph Searching: An Algebraic Approach.
J. ACM, 1981

Communication Through Message Passing or Shared Memory: A Formal Comparison.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1979
A Flexible Environment for Program Development Based on a Symbolic Interpreter.
Proceedings of the 4th International Conference on Software Engineering, 1979

1978
Optimizing Decision Trees Through Heuristically Guided Search.
Commun. ACM, 1978

Shortest Path Problems and Tree Grammars: An Algebraic Framework.
Proceedings of the Graph-Grammars and Their Application to Computer Science and Biology, International Workshop, Bad Honnef, October 30, 1978

1977
Theorem Proving with Structure Sharing and Efficient Unification.
Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977

1976
Observability Concepts in Abstract Data Type Specifications.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
Form Dynamic Programming To Search Algorithms With Functional Costs.
Proceedings of the Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, 1975

1974
Networks of constraints: Fundamental properties and applications to picture processing.
Inf. Sci., 1974

Optimal matching of wheat chromosomes.
Computer Graphics and Image Processing, 1974

Optimization Methods in Image Processing.
IFIP Congress, 1974

Dynamic Programming Schemata.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

1973
Towards a Formal Definition of the Control in Structured Programs.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

Additive AND/OR Graphs.
Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, 1973

1971
On the Optimal Detection of Curves in Noisy Pictures.
Commun. ACM, 1971

On the Optimal Approximation of Discrete Functions with Low-dimensional Tables.
IFIP Congress (2), 1971

Optimal Smoothing in Picture Processing: An Application to Fingerprints.
IFIP Congress (1), 1971

1970
A Grey-Weighted Skeleton
Information and Control, August, 1970

Separable Graphs, Planar Graphs and Web Grammars
Information and Control, May, 1970

On the Minimization of READ-ONLY Memories in Microprogrammed Digital Computers.
IEEE Trans. Computers, 1970

On Limit Properties in Digitization Schemes.
J. ACM, 1970

A Note on Minimal Length Polygongal Approximation to a Digitized Contour.
Commun. ACM, 1970

Heuristically Guided Search and Chromosome Matching.
Artif. Intell., 1970

1969
Continuous Skeletons from Digitized Images.
J. ACM, 1969

1968
A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance.
J. ACM, 1968


  Loading...