A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Information and Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
An abstract machine for concurrent modular systems: CHARM
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Process versus unfolding semantics for place/transition Petri nets
Theoretical Computer Science - Special volume on Petri nets
Parameterized structured operational semantics
Fundamenta Informaticae
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Functorial models for petri nets
Information and Computation
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
Dynamic connectors for concurrency
Theoretical Computer Science
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Normal forms for algebras of connections
Theoretical Computer Science
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Representation Theorems for Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Algebraic Models for Contextual Nets
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Synchronized Hyperedge Replacement with Name Mobility
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Unfolding and Event Structure Semantics for Graph Grammars
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Reconfiguration of Software Architecture Styles with Name Mobility
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
An Event Structure Semantics for Safe Graph Grammars
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Graph Grammars for distributed systems
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Tile Transition Systems as Structured Coalgebras
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in Computer Science
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Comparing two approaches to compensable flow composition
CONCUR 2005 - Concurrency Theory
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Unfolding semantics of graph transformation
Information and Computation
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronised hyperedge replacement as a model for service oriented computing
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Event structure semantics for nominal calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Hi-index | 0.00 |
Ugo's research activity in the area ofModels of Computation (MoC, for short) has been prominent, influential and broadly scoped. Ugo's trademark is that undefinable ability to understand and distill computational aspects into new models as if you were reading them out of some evident connection between well-know models: only, most often, that connection is really visible only after Ugo shows the way. Like experienced sailors have trusted compasses and sextants to help them find the best routes to harbour, Ugo relies on a bag of favourite tools which he has used along the years to deliver a variety of contributions to the MoC area. To mention just three (in alphabetic order): algebraic techniques, concurrency theory, and unification mechanisms.In this introductory contribution we would like to recall some of the influentialMoC models put forward by Ugo which cut across the three approaches. Before doing that, it is worth devoting some space to discuss the three aspects separately. Notably, the use of category theory is a pervasive common trait.