Ugo Montanari

Modelling and Minimising the Fusion calculus (2009)

Abstract. We present a service-oriented approach to the verification of properties of distributed systems specified in dialects of the π-calculus. Our verification methodology allows programming the...

Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Kidane Yemane

Abstract. We present a partition refinement algorithm for the Fusion calculus. The algorithm is based on HD-automata and exploits a coalgebraic functor representing a symbolic semantics of the Fusion...

A coalgebraic theory of reactive systems (2009)

Ugo Montanari, Ugo Montanari

In this report we study the connection between two well known models for interactive systems. Reactive Systems à la Leifer and Milner allow to derive an interactive semantics from a reduction...

Event Structure Semantics for Dynamic Graph Grammars (2009)

Roberto Bruni, Hernán Melgratti, Ugo Montanari, Paolo Baldan, Hartmut Ehrig, Julia Padberg, ...

Abstract: Dynamic graph grammars (DGGs) are a reflexive extension of Graph Grammars that have been introduced to represent mobile reflexive systems and calculi at a convenient level of abstraction....

Modelling Calculi with Name Mobility using Graphs with Equivalences (2008)

Paolo Baldan, Fabio Gadducci, Ugo Montanari

In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for...

Insights emerged while comparing three models for (2008)

Theoretical Computer Science, to appear A 2 CCS: Atomic Actions for CCS (2008)

global computing

Roberto Gorrieri, Sergio Marchetti, Ugo Montanari

1.

Synchronizations with Mobility for Graph Transformations ⋆ (2008)

Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility ⋆ (2008)

Our work is aimed at developing high-level models for complex global computing systems. At the high level of abstraction, the primitives made available by the underlying middleware are used to...

Open Bisimulation for the Concurrent Constraint Pi-calculus ⋆ (2008)

We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform actions on adjacent...

Synchronised Hyperedge Replacement as a Model (2008)

Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous communication...

Gian Luigi Ferrari, Dan Hirsch, Ivan Lanese, Ugo Montanari, Emilio Tuosto

SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets (2008)

Nachum Dershowitz, Claude Kirchner, Ugo Montanari, Francesca Rossi

Abstract. Starting from existing spreadsheet software, like Lotus 1-2-3 R ○ , Excel R ○ , or Spreadsheet 2000 R ○ , we propose a sequence of enhancements to fully integrate constraint-based...

Universit`a di Pisa (2008)

Graph Transformations, Ivan Lanese, Ugo Montanari

Abstract We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for...

and Backwards? (2008)

Paolo Baldan, Andrea Corradini, Ugo Montanari, Leila Ribeiro, Paolo Baldan, Andrea Corradini, ...

Coalgebraic Models for Reactive Systems ⋆ (2008)

Normal forms for stateless connectors (2008)

Abstract. Reactive Systems à la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This theory has been...

Roberto Bruni, Ivan Lanese, Ugo Montanari, Roberto Bruni, Ivan Lanese, ...

Abstract. The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the...

www.elsevier.com/locate/entcs A Graphical Fusion Calculus ⋆ (2008)

A coalgebraic theory of reactive systems (2008)

We analyze the relationship between Fusion Calculus and graph transformations defined in the Synchronized Hyperedge Replacement (SHR) style. In particular we show that the underlying algebraic...

Ugo Montanari, Ugo Montanari

In this report we study the connection between two well known models for interactive systems. Reactive Systems à la Leifer and Milner allow to derive an interactive semantics from a reduction...

Scenario � Largely distributed systems (2008)

Ugo Montanari, Roberto Bruni, Hernan Melgratti (pisa, Cosimo Laneve (bologna

– Global Computing (GC) – Web programming and web services � Asynchronous communication � Transactions, contracts, negotiations, decisions, agreements, choices – Causality, concurrency and...

Modular Verification of Systems via Service Coordination ⋆ (2008)

Event Structure Semantics for Dynamic Contextual Nets ⋆ (2008)

Abstract. We present a service-oriented approach to the verification of properties of distributed systems specifies in dialects of the π-calculus. Using our verification methodology it is possible...

A congruence result for process calculi with (2008)

Petri nets and Graph Transformation Systems (GTSs) are two well-known models for concurrent systems. Petri nets, conceptually simpler, had became a reference model for experimenting with and...

Modelling Calculi with Name Mobility using Graphs with Equivalences (2008)

structural axioms

Paolo Baldan, Fabio Gadducci, Ugo Montanari

In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for...

Verification On The Web Of Mobile Systems ⋆ (2008)

Gianluigi Ferrari, Stefania Gnesi, Ugo Montanari, Roberto Raggi, Gianluca Trentanni, Emilio Tuosto

Abstract. Web services allow the components of applications to be highly decentralized, dynamically reconfigurable. Moreover, Web services can interoperate easily inside an heterogeneous network...

Under consideration for publication in Theory and Practice of Logic Programming 1 Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming∗ (2008)

CoMeta Project Workshop Preliminary Version Some characterization results for permutation (2008)

In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process...

G-Reactive Systems as Coalgebras (2008)

In recent years, many general presentations (metamodels) for calculi with namepassing, either operational or denotational in flavour, have been proposed. In this paper, we investigate the connections...

Logic and Formal Languages]: Mathematical Logic--mechanical theorem proving; 1.2.3 [Artifi- cial Intelligence]: Deduction and Theorem Proving--resolution (2008)

The semantics of process calculi has traditionally been specified by labelled transition systems (LTSs), but with the development of name calculi it turned out that definitions employing reduction...

Alberto Martelli, Ugo Montanari

The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations, and a nondeterministic algorithm is given. A new unification...

A Compositional Coalgebraic Model of Monadic Fusion Calculus (2008)

Abstract Flat Committed Join in Join 1 (2008)

Abstract. We propose a compositional coalgebraic semantics of the Fusion Calculus of Parrow and Victor in the version with explicit fusions by Gardner and Wischik. We follow a recent approach...

found at the ENTCS Macro Home Page. Hierarchical Design Rewriting with Maude 1 (2008)

Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e....

References (2008)

J. Armstrong, R. Virding, C. Wikström, M. Williams Concurrent, H. Garavel, F. Lang, ...

Erlang to µCRL.In Proceedings of the International Conference on Application

Roberto Bruni, Alberto Lluch Lafuente, Ugo Montanari

Replace this file with prentcsmacro.sty for your meeting,

Event Structure Semantics for Dynamic Graph Grammars (2008)

Roberto Bruni, Hernán Melgratti, Ugo Montanari, Paolo Baldan, Hartmut Ehrig, Julia Padberg, ...

Abstract: Dynamic graph grammars (DGGs) are a reflexive extension of Graph Grammars that have been introduced to represent mobile reflexive systems and calculi at a convenient level of abstraction....

Higher Order Semiring-based Constraints (2008)

Pre-nets, read arcs and unfolding: a functorial presentation Extended abstract (2008)

Abstract Semiring-based constraint problems (SCSPs) [BMR95,BMR97] extend classical constraint problems (CSPs) by allowing preferences, costs, priorities, probabilities, and other soft features. They...

Paolo Baldan, Roberto Bruni, Ugo Montanari

P/T Petri nets are one of the most widely known models of concurrency. Since their introduction [Pet62], the conceptual simplicity of the model and its intuitive graphical presentation have attracted...

Higher Order Semiring-based Constraints (2008)

Normal forms for stateless connectors (2008)

Abstract Semiring-based constraint problems (SCSPs) [BMR95,BMR97] extend classical constraint problems (CSPs) by allowing preferences, costs, priorities, probabilities, and other soft features. They...

Roberto Bruni, Roberto Bruni, Ivan Lanese, Ivan Lanese, Ugo Montanari, ...

Abstract. The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the...

DOI 10.1007/s10990-006-8749-3 About permutation algebras, (pre)sheaves and named sets ∗ (2008)

Normal forms for stateless connectors (2008)

Abstract In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)sheaf...

Roberto Bruni, Ivan Lanese, Ugo Montanari

Roberto Bruni, Ivan Lanese, and Ugo Montanari Dipartimento di Informatica, Universit`a di Pisa, Italia.

Under consideration for publication in Theory and Practice of Logic Programming 1 An Interactive Semantics of Logic Programming (2008)

Roberto Bruni, Ugo Montanari, Francesca Rossi

We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination...

Modelling Multicast QoS Routing by using Best-Tree Search in AND-OR Graphs and Soft Constraint Logic Programming (2008)

Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini

Abstract. We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we draw the network adapting it to a weighted AND-OR graph, where the...

Pre-nets, read arcs and unfolding: a functorial presentation (2008)

Paolo Baldan, Roberto Bruni, Ugo Montanari

Abstract. Pre-nets have been recently proposed as a means of providing a functorial algebraic semantics to Petri nets (possibly with read arcs), overcoming some previously unsolved subtleties of the...

First order and higher order tile models for open and mobile systems (abstract (2008)

Modelling Fusion calculus using HD-automata ⋆ (2008)

and mobile systems

Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Björn Victor, Kidane Yemane

Abstract. We propose a coalgebraic model of the Fusion calculus based on HD-automata. The main advantage of the approach is that the partition refinement algorithm designed for HD-automata is easily...

Algebraic theories for contextual pre-nets ⋆ (2008)

Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone

Abstract. The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors...

Flat Committed Join in Join 1 (2008)

Modelling Fusion calculus using HD-automata? (2008)

Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e....

Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Kidane Yemane

Abstract. We propose a coalgebraic model of the Fusion calculus based on HD-automata. The main advantage of the approach is that the partition refinement algorithm designed for HD-automata is easily...

A zero-safe’s agenda (2008)

From Theory to Practice inTransactional Composition of Web Services (2008)

Join calculus, transactions and zero-safe nets Many different proposals (e.g., Petri nets, Linda and other tuple-space languages, CHAM, Join calculus) for applying formal methods to distributed...

Roberto Bruni, Gianluigi Ferrari, Ugo Montanari, Daniele Strollo, Emilio Tuosto

Summary (2008)

Barbara König, Ugo Montanari

Recently there has been a lot of research, combining concepts of process algebra with those of the theory of graph grammars and graph transformation systems. Both can be viewed as general frameworks...

QAPL 2004 Preliminary Version (2008)

Quantitative Calculus And, Alberto Lluch-lafuente, Ugo Montanari

Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are...

Welcome to Malta! (2008)

Gordon J. Pace, Gerardo Schneider, Gordon J. Pace, Gerardo Schneider (editors, ...

FLACOS’08 Workshop Proceedings Research Report No.

1 (2007)

Roberto Bruni, Ugo Montanari, Vladimiro Sassone

and tile logic

Under consideration for publication in Theory and Practice of Logic Programming 1 An Interactive Semantics of Logic Programming (2007)

Roberto Bruni, Ugo Montanari, Francesca Rossi

We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination...

Tiles, Rewriting Rules and CCS (2007)

The Tile Model - Errata to draft available on the net (2007)

In [12] we introduced the tile model, a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both...

SCLP Semantics for (multi-criteria) Shortest Path Problems (2007)

xtend Definition 13, in order to include also the new concept of algebraicity. In the first version it is was stated as follows. Definition 13 (tile functoriality). Let R = h\Sigma oe ; \Sigma ; N;Ri...

Stefano Bistarelli Ugo, Ugo Montanari, Francesca Rossi

. The aim of the paper is to show an example of interaction between the AI and OR fields of research using the Constraint Programming (CP) framework to glue them together. We solve a shortest path...

Constraint Satisfaction, Constraint Programming, and Concurrency (2007)

Research Report UDMI/26/2003/RR About permutation algebras and sheaves (and named sets, too!) ∗ (2007)

Recently constraint satisfaction has been embedded in various high-level declarative programming environments, like the Constraint Logic Programming framework, and even more recently such...

CoMeta Project Workshop Preliminary Version Some characterization results for permutation (2007)

In recent years, many general presentations (metamodels) for calculi dealing with names, e.g. process calculi with name-passing, have been proposed. (Pre)sheaf categories have been proved to satisfy...

3. Foundations of Constraint Programming Approaches 3.1 Concurrent Semantics for Concurrent Constraint Programs (2007)

In recent years, many general presentations (metamodels) for calculi with namepassing, either operational or denotational in flavour, have been proposed. In this paper, we investigate the connections...

Francesca Rossi, Ugo Montanari

Abstract. A concurrent semantics is a semantics where concurrency can be realistically represented and naturally described. Therefore we believe that every concurrent language should be provided with...

Under consideration for publication in Theory and Practice of Logic Programming 1 An Interactive Semantics of Logic Programming (2007)

Roberto Bruni, Ugo Montanari, Francesca Rossi

We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination...

2 (2007)

Andrea Corradini, Reiko Heckel, Ugo Montanari

Abstract. Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft...

b (2007)

In this paper we address the issue of providing a structured coalgebra presentation of transition systems with algebraic structure on states determined by an equational speci cation. More precisely,...

Structured Coalgebras and Minimal (2007)

Scientifica E Tecnologica, Montanari U, Pistore M, Ugo Montanari, ...

This report has been submittedforted 17881 outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Reportfort 17 dissemination of its contents....

F.3.2 [Logics And Meanings Of Programs]: Semantics of Programming Languages| (2007)

6, chemin de Maupertuis. F-38240 Meylan (2007)

We extend the Constraint Logic Programming (CLP) formalism in order to handle semiringbased constraints. This allows us to perform in the same language both constraint solving and optimization. In...

Jean Marc Andreoli, Uwe M. Borghoff, Remo Pareschi, Stefano Bistarelli, Ugo Montanari, Francesca Rossi

The irreversible trend toward decentralized information sources makes less and less adequate the current approaches to search mostly based on a centralized index. The Constraint Based Knowledge...

Models & Languages for Open Distributed Systems (2007)

Roberto Bruni, Ugo Montanari, Vladimiro Sassone

Highly distributed networks have now become a common platform for large scale distributed programming. While a number of useful internet applications can be developed using the standard client-server...

Dynamic (2007)

bisimilarity for reconfigurable and mobile systems via tile logic

Zero-Safe Nets: Comparing the (2007)

Collective And Individual, Ugo Montanari, Roberto Bruni, Roberto Bruni

The main feature of zero-safe nets is a primitive notion of transition synchronization. To this aim, besides ordinary places, called stable places, zero-safe nets are equipped with zero places, which...

Can Actors and π-Agents Live Together? (2007)

Ugo Montanari, Carolyn Talcott

The syntax and semantics of actors and -agents is first defined separately, using a uniform, "unbiased" approach. New coordination primitives are the added to the union of the two calculi...

First order and higher order tile models for open and mobile systems (abstract (2007)

History-Dependent Automata (2007)

There are two principal ways in which the dynamics of many calculi can be naturally modeled: (1) by means of labeled transition systems (LTS) where states are terms in the calculus and transition...

Scientifica E Tecnologica, Montanari U, Pistore M, Ugo Montanari, Marco Pistore

This report has been submittedforted 17881 outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Reportfort 17 dissemination of its contents....

Unicast and Multicast Qos Routing with Soft Constraint Logic Programming (2007)

Bistarelli, Stefano, Montanari, Ugo, Rossi, Francesca, Santini, Francesco

We present a formal model to represent and solve the unicast/multicast routing problem in networks with Quality of Service (QoS) requirements. To attain this, first we translate the network adapting...

Cc-pi: A constraint-based language for specifying service level agreements (2007)

Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming Abstract (2007)

Abstract. Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost,...

Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini

We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, where the weight on...

Synchronised Hyperedge Replacement as a Model for Service Oriented Computing (2006)

Ferrari, Gian Luigi, Hirsch, Dan, Lanese, Ivan, Montanari, Ugo, Tuosto, Emilio

Concurrent rewriting for graphs with equivalences (2006)

Paolo Baldan, Fabio Gadducci, Ugo Montanari

Abstract. Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to coalesce...

Event structure semantics for nominal calculi (2006)

Event structure semantics for nominal calculi (2006)

Abstract. Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal calculi have...

About permutation algebras, (pre)sheaves and named sets (2006)

Insights emerged while comparing three models for global computing (2006)

Abstract. In this paper, we survey some well-known approaches proposed as general models for calculi dealing with names (like e.g. process calculi with namepassing). We focus on (pre)sheaf...

Lanese, Ivan, Montanari, Ugo

In this paper we outline the main ideas emerged while studying a chain of mappings from emph{Fusion Calculus} to emph{logic programming}, using emph{Synchronized Hyperedge Replacement} (with both...

05081 Abstracts Collection -- Foundations of Global Computing (2006)

Fiadeiro, José Luiz, Montanari, Ugo, Wirsing, Martin

From 20.02.05 to 25.02.05, the Dagstuhl Seminar 05081 on ``Foundations of Global Computing'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar,...

Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming (2005)

Lanese, Ivan, Montanari, Ugo

In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process...

Comparing two approaches to compensable flow composition (2005)

Bruni, Roberto, Butler, Michael, Ferreira, Carla, Hoare, Tony, Melgratti, Hernan, Montanari, Ugo

Comparing two approaches to compensable flow composition (2005)

Bruni, Roberto, Butler, Michael, Ferreira, Carla, Hoare, Tony, Melgratti, Hernan, Montanari, Ugo

Comparing two approaches to compensable flow composition (2005)

Bruni, Roberto, Butler, Michael, Ferreira, Carla, Hoare, Tony, Melgratti, Hernan, Montanari, Ugo

Model Checking for Nominal Calculi (2005)

Ferrari, Gian Luigi, Montanari, Ugo, Tuosto, Emilio

Comparing two approaches to compensable flow composition (2005)

Roberto Bruni, Michael Butler, Carla Ferreira, Tony Hoare, Hernán Melgratti, Ugo Montanari

Abstract. Web services composition is an emerging paradigm for the integration of long running business processes, attracting the interest of both Industry, in terms of XML-based standards for...

Model checking for nominal calculi (2005)

Deriving weak bisimulation congruences from reduction systems (2005)

Abstract. Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model checking a...

Roberto Bruni, Fabio Gadducci, Ugo Montanari, Paweł Sobociński

Abstract. The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition systems...

A general name binding mechanism (2005)

Michele Boreale, Maria Grazia Buscemi, Ugo Montanari

Abstract. We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of binding....

Synchronised hyperedge replacement as a model for service oriented computing (2005)

Gian Luigi Ferrari, Dan Hirsch, Ivan Lanese, Ugo Montanari, Emilio Tuosto

Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting formalism. Components...

Complete axioms for stateless connectors, in (2005)

Roberto Bruni, Ivan Lanese, Ugo Montanari

Abstract. The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the...

A General Name Binding Mechanism (2005)

Michele Boreale Maria, Maria Grazia Buscemi, Ugo Montanari

We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of binding. The...

Quantitative μ-calculus and CTL defined over constraint semirings (2005)

Alberto Lluch-lafuente, Ugo Montanari

Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are...

From theory to practice in transactional composition of web services (2005)

Roberto Bruni, Gianluigi Ferrari, Hernán Melgratti, Ugo Montanari, Daniele Strollo, Emilio Tuosto

Abstract We address the problem of composing Web Services in long-running transactional business processes, where compensations must be dealt with appropriately. The framework presented in this paper...

Comparing two approaches to compensable flow composition (2005)

Roberto Bruni, Michael Butler, Carla Ferreira, Tony Hoare, Hernán Melgratti, Ugo Montanari

Abstract. Web services composition is an emerging paradigm for the integration of long running business processes, attracting the interest of both Industry, in terms of XML-based standards for...

Complete Axioms for Stateless Connectors (2005)

Roberto Bruni, Ivan Lanese, Ugo Montanari

Abstract. The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the...

Deriving weak bisimulation congruences from reduction systems (2005)

Roberto Bruni, Fabio Gadducci, Ugo Montanari, Paweł Sobociński

Abstract. The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition systems...

A general name binding mechanism (2005)

Michele Boreale, Maria Grazia Buscemi, Ugo Montanari

Abstract. We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of binding....

From theory to practice in transactional composition of web services (2005)

Roberto Bruni, Gianluigi Ferrari, Hernán Melgratti, Ugo Montanari, Daniele Strollo, Emilio Tuosto

Abstract We address the problem of composing Web Services in long-running transactional business processes, where compensations must be dealt with appropriately. Long-running transactions differ from...

04241 Abstracts Collection -- Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems (2005)

König, Barbara, Montanari, Ugo, Gardner, Philippa

Recently there has been a lot of research, combining concepts of process algebra with those of the theory of graph grammars and graph transformation systems. Both can be viewed as general frameworks...

Shaped hierarchical architectural design (2004)

Dan Hirsch, Ugo Montanari

The architectural design of systems deals with the high level structuring of configurations. Checking that a system belongs to an architectural style (or shape)

D-fusion: a distinctive fusion calculus (2004)

Michele Boreale, Maria Grazia Buscemi, Ugo Montanari

Abstract. Fusion calculus is commonly regarded as a generalisation of picalculus. Actually, we prove that there is no uniform fully abstract embedding of pi-calculus into Fusion. This fact motivates...

Synchronization algebras with mobility for graph transformations (2004)

D-fusion: a distinctive fusion calculus (2004)

We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for distributed and...

Michele Boreale, Maria Grazia Buscemi, Ugo Montanari

Abstract. We study the relative expressive power of Fusion and pi-calculus. Fusion is commonly regarded as a generalisation of pi-calculus. Actually, we prove that there is no uniform fully abstract...

Synchronization algebras with mobility for graph transformations (2004)

Nested commits for mobile calculi: extending Join (2004)

Abstract We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for...

Roberto Bruni, Hernan Melgratti, Ugo Montanari

In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., contract stipulation,...

D-Fusion: a Distinctive Fusion Calculus (2004)

Michele Boreale, Maria Grazia Buscemi, Ugo Montanari

We study the relative expressive power of Fusion and pi-calculus. Fusion is commonly regarded as a generalisation of pi-calculus. Actually, we prove that there is no uniform fully abstract embedding...

Nested commits for mobile calculi: extending Join (2004)

Coalgebraic Minimisation of HDautomata for the π-Calculus in a Polymorphic λ-Calculus (2004)

Abstract In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., distributed...

Coalgebraic Minimisation of HDautomata for the π-Calculus in a Polymorphic λ-Calculus (2004)

We introduce finite-state verification techniques for the π-calculus whose design and correctness are justified coalgebraically. In particular, we formally specify and implement a minimisation...

D-fusion: a distinctive fusion calculus (2004)

We give a formal definition of HD-automata based on coalgebras. Exploiting such definition we formally specify and implement a minimisation algorithm for HD-automata derived from π-calculus agents....

Michele Boreale, Maria Grazia Buscemi, Ugo Montanari

Abstract. Fusion calculus is commonly regarded as a generalisation of pi-calculus. Actually, we prove that there is no uniform fully abstract embedding of pi-calculus into Fusion. This fact motivates...

From Co-algebraic Specifications to Implementation: The MIHDA toolkit (2003)

Ferrari, Gianluigi, Montanari, Ugo, Raggi, Roberto, Tuosto, Emilio

Graph-based models of internetworking systems (2003)

Under consideration for publication in Theory and Practice of Logic Programming 1 Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming∗ (2003)

Abstract. Graphical notations have been widely accepted as an expressive and intuitive working tool for system specification and design. This paper outlines a declarative approach based on...

Coreflective concurrent semantics for single-pushout graph grammars (2003)

In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process...

Paolo Baldan, Andrea Corradini, Ugo Montanari, Leila Ribeiro

Abstract. The problem of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets has been faced several times along the years, both for the...

Flat Committed Join in Join (2003)

Roberto Bruni, Hernan Melgratti, Ugo Montanari

Committed Join (cJoin) is an extension of Join with high-level primitives for programming dynamic nested negotiations with compensations. In this paper we show that flat cJoin processes (i.e....

A Formal Basis for Reasoning on Programmable QoS (2003)

Rocco De Nicola, Gianluigi Ferrari, Ugo Montanari, Rosario Pugliese, Emilio Tuosto

The explicit management of Quality of Service (QoS) of network connectivity, such as, e.g., working cost, transaction support, and security, is a key requirement for the development of the novel wide...

Observational Congruences for Dynamically Reconfigurable Tile Systems (2003)

Roberto Bruni, Ugo Montanari, Vladimiro Sassone

The sos formats that ensure that bisimilarity is a congruence fail in the presence of structural axioms on states. Dynamic bisimulation, introduced to characterize the coarsest congruence for ccs...

Extending the zero-safe approach to coloured, reconfigurable and dynamic nets (2003)

From co-algebraic specifications to implementation: The Mihda toolkit (2003)

Gianluigi Ferrari, Ugo Montanari, Roberto Raggi, Emilio Tuosto

Abstract. This paper describes the architecture of a toolkit, called Mihda, providing facilities to minimise labelled transition systems for name passing calculi. The structure of the toolkit is...

Soft constraint logic programming and generalized shortest path problems (2002)

Comparing Logics for Rewriting: Rewriting logic, action calculi and tile logic (2002)

In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and...

Soft Concurrent Constraint Programming (2002)

The large diffusion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy specification of such systems. The aim...

Stefano Bistarelli Ugo, Ugo Montanari, Francesca Rossi

Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint...

transactions in the join calculus � (2002)

Roberto Bruni, Cosimo Laneve, Ugo Montanari, Roberto Bruni, Cosimo Laneve, ...

Centralized and distributed orchestration of

Orchestrating Transactions in Join Calculus (2002)

Roberto Bruni Cosimo, Roberto Bruni, Cosimo Laneve, Ugo Montanari

We discuss the principles of distributed transactions, then we define an operational model which meets the basic requirements and we give a prototyping implementation for it in join-calculus. In...

Functorial models for contextual prenets (2002)

Roberto Bruni, Roberto Bruni, José Meseguer, José Meseguer, Ugo Montanari, Ugo Montanari, ...

Functorial models for contextual pre-nets

Orchestrating transactions in join calculus (2002)

Roberto Bruni, Cosimo Laneve, Ugo Montanari

bruni,ugo¢

Soft concurrent constraint programming (2002)

Soft Concurrent Constraint Programming (2002)

Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint...

Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Area Della Ricerca, Via G. Moruzzi

Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint...

An interactive semantics of logic programming (2001)

Bruni, Roberto, Montanari, Ugo, Rossi, Francesca

We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination...

Contextual petri nets, asymmetric event structures and processes (2001)

Observational equivalence for synchronized graph rewriting (2001)

We present an event structure semantics for contextual nets, an extension of P/T Petri nets where transitions can check for the presence of tokens without consuming them (read-only operations). A...

Soft Constraint Logic Programming and Generalized Shortest Path Problems (2001)

Abstract. We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks. We use the framework of...

Stefano Bistarelli, Ugo Montanari, F. Rossi, Francesca Rossi, Padova Italy

In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and...

Functorial Models for Petri Nets (2001)

Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone

this paper we investigate the operational, algebraic and logical aspects of PT nets under both the CTph and the ITph, exploiting the features of the algebraic approach to establish formal...

Transactions and Zero-Safe Nets (2001)

Contextual Petri Nets, Asymmetric Event Structures, and Processes (2001)

When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e., that...

Paolo Baldan Andrea, Andrea Corradini, Ugo Montanari

. We present an event structure semantics for contextual nets, an extension of P/T Petri nets where transitions can check for the presence of tokens without consuming them (read-only operations). A...

Algebraic Theories for Contextual Pre-Nets (2001)

Roberto Bruni, Jose Meseguer, Ugo Montanari, Vladimiro Sassone

The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors that must be...

Zero-safe net models for transactions in linda (2001)

Transactions and zero-safe nets (2001)

Zero-safe nets are a variation of Petri nets, where transactions can be suitably modeled. The idea is to distinguish between stable places (whose markings define observable states) and zero-safe...

Observational equivalence for synchronized graph rewriting (2001)

Abstract When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e.,...

Barbara König, Ugo Montanari

Abstract. We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks. We use the framework of...

Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (2000)

Graphical operational semantics (2000)

The large diffusion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy specification of such systems. The aim...

Andrea Corradini, Reiko Heckel, Ugo Montanari

We combine the methodology of Plotkin-style operational semantics with graph transformation concepts in order to specify the operational semantics of diagram languages.

Executing Transactions in Zero-Safe Nets (2000)

Normal Forms for Algebras of Connections (2000)

Distributed systems are often composed by many heterogeneous agents that can work concurrently and exchange information. Therefore, in their modeling via pt nets we must be aware that the basic...

Unfolding of Double-Pushout Graph Grammars is a Coreflection (2000)

Recent years have seen a growing interest towards algebraic structures that are able to express formalisms different from the standard, tree-like presentation of terms. Many of these approaches...

Normal Forms for Algebras of Connections (2000)

. In a recent paper, mimicking Winskel's construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be...

History Preserving Bisimulation for Contextual Nets (2000)

Recent years have seen a growing interest towards algebraic structures that are able to express formalisms different from the standard, tree-like presentation of terms. Many of these approaches...

Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone

. We investigate the notion of history preserving bisimulation [15, 18, 3] for contextual P/T nets, a generalization of ordinary P/T Petri nets where a transition may check for the presence of tokens...

and (2000)

We show that although the algebraic semantics of place/transition Petri nets under the collective token philosophy can be fully explained in terms of strictly symmetric monoidal categories, the...

Constraint Programming and Graph Algorithms (2000)

Mehlhorn, Kurt, Montanari, Ugo, Rolim, José D. P., Welzl, Emo

Contextual Petri Nets, Asymmetric Event Structures, and Processes (1999)

Paolo Baldan, Andrea Corradini, U. Montanari, Paolo Baldan, Andrea Corradini, Ugo Montanari

. We present an event structure semantics for contextual nets, an extension of P/T Petri nets where transitions can check for the presence of tokens without consuming them (read-only operations). A...

Normal Forms for Partitions and Relations (1999)

Normal Forms for Partitions and Relations (1999)

Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, tree-like presentation of terms. Many of these approaches...

A 2-category View for Double Categories with Shared Structure (1999)

Recent years have seen a growing interest towards algebraic structures that are able to express formalisms different from the standard, tree-like presentation of terms. Many of these approaches...

Cartesian Closed Double Categories, their Lambda-Notation, and the Pi-Calculus (1999)

2-categories and double categories are respectively the natural semantic ground for rewriting logic (rl) and tile logic (tl). Since 2-categories can be regarded as a special case of double...

Cartesian Closed Double Categories, their Lambda-Notation, and the Pi-Calculus (1999)

We introduce the notion of cartesian closed double category to provide mobile calculi for communicating systems with specific semantic models: One dimension is dedicated to compose systems and the...

Roberto Bruni And, Roberto Bruni, Ugo Montanari

We introduce the notion of cartesian closed double category to provide mobile calculi for communicating systems with specific semantic models: One dimension is dedicated to compose systems and the...

Tile Transition Systems as Structured Coalgebras (1999)

Andrea Corradini, Reiko Heckel, Ugo Montanari

. The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side effects which are endowed with...

Zero-Safe Nets: Composing Nets via Transition Synchronization (1999)

Executable Tile Specifications for Process Calculi (1999)

Zero-safe nets have been introduced to extend classical Petri nets with a primitive notion of transition synchronization. To this aim, besides ordinary places, called stable, zero-safe nets are...

Normal Forms for Partitions and Relations (1999)

. Tile logic extends rewriting logic by taking into account sideeffects and rewriting synchronization. These aspects are very important when we model process calculi, because they allow us to express...

Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems (1999)

. Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, tree-like presentation of terms. Many of these approaches...

Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems (1999)

. In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and...

Unfolding and Event Structure Semantics for Graph Grammars (1999)

. In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and...

Executable Tile Specifications for Process Calculi (1999)

. We propose an unfolding semantics for graph transformation systems in the double-pushout (DPO) approach. Mimicking Winskel's construction for Petri nets, a graph grammar is unfolded into an...

Consistent Transformations for Software Architecture Styles of Distributed Systems (1999)

. Tile logic extends rewriting logic by taking into account sideeffects and rewriting synchronization. These aspects are very important when we model process calculi, because they allow us to express...

Dan Hirsch, Ugo Montanari

One major problem for the specification and verification of software architectures and specially with distributed systems, is when system evolution includes dynamic changes and reconfigurations of...

Lecture Notes in Computer Science. Concur '96: Concurrency Theory, (1998)

Montanari, Ugo, Sassone, Vladimiro

The purpose of the CONCUR conferences is to bring together researchers, developers and students in order to advance the science of concurrency theory and promote its applications. Interest in the...

Graph grammars and constraint solving for software architecture styles (1998)

Dan Hirsch, Paola Inverardi, Ugo Montanari, Dep De Computacion, Dipartamento Di Matematica

The description of a software architecture style must include the structural model of the components and their interactions, the laws governing the dynamic changes in the architecture, and the...

A comparison of Petri net semantics under the collective token philosophy (1998)

Jos E Meseguer, Roberto Bruni, Roberto Bruni, Jose Meseguer, Ugo Montanari, Ugo Montanari, ...

et al.:

Zero-Safe Nets: The Individual Token Approach (1998)

History-Dependent Automata (1998)

In this paper we provide both an operational and an abstract concurrent semantics for zero-safe nets under the individual token philosophy. The main feature of zero-safe nets is a primitive notion of...

Ugo Montanari, Ugo Montanari, Marco Pistore, Marco Pistore

In this paper we present history-dependent automata (HD-automata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with history-dependent formalisms....

Process and Term Tile Logic (1998)

Roberto Bruni, José Meseguer, Roberto Bruni, Ugo Monzanari, Ugo Montanari

In a similar way as 2-categories can be regarded as a special case of double categories, rewriting logic (in the unconditional case) can be embedded into the more general tile logic, where also...

Modeling Process Coordination Via Tiles, Graphs, And Constraints (1998)

A Comparison of Petri Net Semantics under the Collective Token Philosophy (1998)

In this paper we describe a simple approach where distributed systems' dynamics is expressed via synchronized graph rewriting. We formalize this approach via the tile model, which is a general...

Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone

. In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities between three such...

An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures (1998)

Can Actors and π-Agents Live Together? (1998)

. We propose an event based semantics for contextual nets, i.e. an extension of Place/Transition Petri nets where transitions can also have context conditions, modelling resources that can be read...

Ugo Montanari, Carolyn Talcott

The syntax and semantics of actors and ß-agents is first defined separately, using a uniform, "unbiased" approach. New coordination primitives are the added to the union of the two calculi...

Concatenable Graph Processes: Relating Processes and Derivation Traces (1998)

A comparison of Petri net semantics under the collective token philosophy (1998)

. Several formal concurrent semantics have been proposed for graph rewriting, a powerful formalism for the specification of concurrent and distributed systems which generalizes P/T Petri nets. In...

Roberto Bruni, Roberto Bruni, José Meseguer, José Meseguer, Ugo Montanari, Ugo Montanari, ...

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...

A comparison of Petri net semantics under the collective token philosophy (1998)

Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone

ABSTRACT. In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities between three...

Semiring-Based Constraint Satisfaction and (1997)

Optimization Stefano Bistarelli, Stefano Bistarelli, Ugo Montanari, Francesca Rossi

We introduce a general framework for constraint satisfaction and optimization where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The...

Semiring-Based Constraint Logic Programming: (1997)

Syntax And Semantics, Stefano Bistarelli, Ugo Montanari, Francesca Rossi

this paper, more simply, soft constraint problems

Semiring-based Constraint Satisfaction and Optimization (1997)

Constraints and Agents for a Decentralized Network Infrastructure (1997)

We introduce a general framework for constraint satisfaction and optimization where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The...

Jean Marc Andreoli, Uwe M. Borghoff, Remo Pareschi, Stefano Bistarelli, Ugo Montanari, Francesca Rossi

The irreversible trend toward decentralized information sources makes less and less adequate the current approaches to search mostly based on a centralized index. The Constraint Based Knowledge...

Zero-Safe Nets, or Transition Synchronization Made Simple (1997)

Zero-Safe Nets, or Transition Synchronization Made Simple (1997)

In addition to ordinary places, called stable, zero-safe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can...

Semiring-based Constraint Logic Programming: Syntax and Semantics (1997)

In addition to ordinary places, called stable, zero-safe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can...

Semiring-based CSPs and Valued CSPs: Basic Properties and Comparison (1996)

We extend the Constraint Logic Programming (CLP) formalism in order to handle semiringbased constraint systems. This allows us to perform in the same language both constraint solving and...

The Tile Model (1996)

Fabio Gadducci, U. Montanari, Fabio Gadducci, Ugo Montanari

. In this paper we introduce a model for a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term...

Stefano Bistarelli, Hélène Fargier, Ugo Montanari, Francesca Rossi, Thomas Schiex, Gérard Verfaillie

. We introduce two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and...

Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization (Extended Abstract) (1996)

U. Montanari, F. Rossi, Ugo Montanari, Francesca Rossi

) Ugo Montanari and Francesca Rossi Universit`a di Pisa, Dipartimento di Informatica Corso Italia 40, 56125 Pisa, Italy E-mail: fugo,rossig@di.unipi.it Abstract. In this extended abstract we describe...

Process versus Unfolding Semantics for Place/Transition Petri Nets (1996)

On the Semantics of Place/Transition Petri Nets (1996)

. In the last few years, the semantics of Petri nets has been investigated in several di#erent ways. Apart from the classical "token game," one can model the behaviour of Petri nets via...

J Os, José Meseguer, Vladimiro Sassone, Ugo Montanari

this paper we extend Winskel's result to PT nets. We start with a rather general category PTNets

Enriched Categories as Models of Computation (1996)

Tiles, Rewriting Rules and CCS (1996)

. In this paper we discuss a general methodology to provide a categorical semantics for a wide class of computational systems, whose behaviour can be described by a suitable set of transition steps....

Semiring-based CSPs and Valued CSPs: Basic Properties and Comparison (1996)

In [12] we introduced the tile model, a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both...

Stefano Bistarelli, Hélène Fargier, Ugo Montanari, Francesca Rossi, Thomas Schiex, Gérard Verfaillie

. In this paper we describe two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a...

The Weak Late pi-calculus Semantics as Observation Equivalence (1995)

Gian-Luigi Ferrari, Ugo Montanari, Paola Quaglia

. We show that the Weak Late -calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and...

Constraint Solving over Semirings (1995)

Symmetric and Cartesian Double Categories as a Semantic Framework for Tile Logic (1995)

We introduce a general framework for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a...

Concurrency and Concurrent Constraint Programming (1995)

this paper we discuss the lifting of these auxiliary structures to double categories. We notice that the internal construction of double categories produces a pathological asymmetric notion of...

CC Programs with both In- and Non-determinism: A Concurrent Semantics (1994)

. The intent of this paper is to provide the basic ideas and the possible alternatives underlying the task of giving a semantics to a concurrent system/language, and to describe a particular approach...

Ugo Montanari, Francesca Rossi, Vijay Saraswat

We present a concurrent semantics for concurrent constraint (cc) programming framework with both ("committed choice") indeterminism and ("backtracking") nondeterminism. The...

Axiomatizing Permutation Equivalence (1994)

Cosimo Laneve, Ugo Montanari

We axiomatize permutation equivalence in term rewriting systems and Klop's orthogonal Combinatory Reduction Systems [Klop 1980]. The axioms for the former ones are provided by the general...

A pi-calculus with Explicit Substitutions: the Late Semantics (1994)

Gianluigi Ferrari, Ugo Montanari, Paola Quaglia

. A new formulation of the -calculus, where name instantiation is handled explicitly, is presented. The explicit handling of name instantiation allows us to reduce the -calculus transitional...

A Concurrent Semantics for Concurrent Constraint Programs via Contextual Nets (1994)

CC Programs with both In- and Non-determinism: A Concurrent Semantics (1994)

We propose a concurrent semantics for concurrent constraint (cc) programs. A contextual net, that is a net with context conditions, besides pre- and post-conditions, is associated to each cc program....

Ugo Montanari, Francesca Rossi, Vijay Saraswat

. We present a concurrent semantics for concurrent constraint (cc) programming framework with both ("committed choice") indeterminism and ("backtracking") nondeterminism. The...

On the Model of Computation of Place/Transition Petri Nets (1994)

Mobility in the Cc-Paradigm (1992)

. In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the behaviour of Petri nets via...

Cosimo Laneve, Ugo Montanari

presented at Mathematical Foundations of Computer Science 1992, LNCS 629, pp. 336--345, 1992. 1 operation takes a constraint c and adds (conjoins) it to the store (when the store is consistent with...

On the Semantics of Petri Nets (1992)

DYNAMIC CONGRUENCE vs. PROGRESSING BISIMULATION for CCS (1992)

Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "token game" is...

Mobility in the Cc-Paradigm (1992)

Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. ff:ø:fi:nil...

Cosimo Laneve, Ugo Montanari

presented at Mathematical Foundations of Computer Science 1992, LNCS 629, pp. 336--345, 1992. operation takes a constraint c and adds (conjoins) it to the store (when the store is consistent with c)....

Dynamic congruence vs. progressing bisimulation for CCS (1992)

CCS Dynamic Bisimulation is Progressing (1991)

Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. α.τ.β.nil...

Constraint Solving and Programming: What Next? (1991)

Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. α.τ.β.nil...

CCS Dynamic Bisimulation is Progressing (1991)

. In this paper we advocate for more flexible and user-friendly constraint solving environments, as well as for constraint programming languages which have great expressive power while maintaining a...

5th International Symposium on Programming (1990)

Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. ff:ø:fi:nil...

Dezani-Ciancaglini, Mariangiola, Montanari, Ugo

Theorem proving with structure sharing and efficient unification (1977)

Alberto Martelli, Ugo Montanari

Efficient proof checking The interest in automatic theorem proving, which was very high in the Al community in the late sixties, has decreased. One of the reasons was the impossibility by now of...

Process and Term Tile Logic

Roberto Bruni Bruni, J. Meseguer, U. Montanari, Roberto Bruni, Ugo Montanari

In a similar way as 2-categories can be regarded as a special case of double categories, rewriting logic (in the unconditional case) can be embedded into the more general tile logic, where also...

The Tile Model

Zero-Safe Nets: Comparing the Collective and Individual Token Approaches

Introduction It is not an overstatement to say that, in the latest years, there has been an unprecedented flow of proposals, aiming at methodologies that could offer a flexible framework (intended as...

Ugo Montanari, Roberto Bruni, Roberto Bruni

The main feature of zero-safe nets is a primitive notion of transition synchronization. To this aim, besides ordinary places, called stable places, zero-safe nets are equipped with zero places, which...

The Tile Model

. In this paper we aim at describing a framework for specifying the behaviour of a wide class of rule-based computational systems. We gathered our inspiration both from the world of term rewriting,...

Contextual Nets

Representation Theorems for Petri Nets

We propose a new kind of nets, called contextual nets, where events may have both preconditions and postconditions, as in the classical case, and also positive or negative context conditions....