Roberto Bruni

A computational approach identifies two regions of Hepatitis C Virus E1 protein as interacting domains involved in viral fusion process (2009)

Bruni, Roberto, Costantino, Angela, Tritarelli, Elena, Marcantonio, Cinzia, Ciccozzi, Massimo, Rapicetta, Maria, ...

Abstract Background The E1 protein of Hepatitis C Virus (HCV) can be dissected into two distinct hydrophobic regions: a central domain containing an hypothetical fusion peptide (FP), and a C-terminal...

Distributed Agreements (2009)

Roberto Bruni

� In commercial applications, separately designed and implemented components must interact � commit (intermediate) results of long-running activities upon (partial) agreements � e.g....

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....

Multiparty sessions in SOC ⋆ (2008)

Roberto Bruni, Ivan Lanese, Hernán Melgratti, Emilio Tuosto

Abstract. Service oriented applications feature interactions among several participants over the network. Mechanisms such as correlation sets and two-party sessions have been proposed in the...

One More Example (2008)

Roberto Bruni

� What should have emerged from this course? � Dealing with distributed systems is not an easy task � Current interests: � Coordination, orchestration, choreography of concurrent and...

Centralized encoding (2008)

Roberto Bruni

� The transactional mechanism of ZSN can be implemented in the join calculus � Centralized version � The fragment corresponding to coloured nets suffices

Deducing Interactions in Partially UnspecifiedBiological Systems (2008)

Paolo Baldan, Andrea Bracciali, Linda Brodo, Roberto Bruni

Abstract. We show how a symbolic approach to the semantics of process alge-bras can be fruitfully applied to the modeling and analysis of partially unspecified biological systems, i.e., systems whose...

Graphically (2008)

Roberto Bruni

� Linda [Gelernter 1985] is a well-known coordination language � Based on generative communication � Primitives for insertion, reading and withdrawal of data tuples to and from a shared data...

Adding Transactions to Linda (2008)

Roberto Bruni

� Zero-Safe nets are based on a two-level classification of resources

PDL Examples (2008)

Roberto Bruni

� In concurrency there have been two mainstream paradigms � Petri-net like � Process Description Languages (PDL) � Simplified concurrent programming languages � Primitives resembles...

Colured Nets (2008)

Roberto Bruni

� We have already seen that the basic net model can be extended in many ways � To model interesting features � e.g. read arcs � To increase expressiveness � e.g. inhibitor arcs � Many...

Tuples and Prefixes (2008)

Roberto Bruni

� The modeling of Linda primitives was based on the assumption that � Emission of the tuple and its rendering in the tuple space were atomic � The so-called ordered semantics � In many...

Formal Models for Distributed Negotiations 4 (2008)

Roberto Bruni, Transactional Workflows, Transactional Workflows

� Designed for process orchestration � DTC for handling distributed business processes in asynchronous environment � BizTalk includes a graphical environment � Three different views...

Normal forms for stateless connectors (2008)

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...

Why Zero-Safe Nets (2008)

Roberto Bruni

� The basic P/T net model does not offer any synchronization between transitions � Only token synchronization � Useful because � Translating primitives of concurrent languages can involve...

Objectives (2008)

Roberto Bruni

� Long running transactions may abort also when some of their sub-transactions have been committed � Committed sub-transactions should be undone � Not always possible: visible events cannot be...

Formal Models for Distributed Negotiations Commit Protocols (2008)

Roberto Bruni

� Data can be inherently distributed � e.g. customers accounts in different branches of the same bank � Data are distributed to achieve failure independence � e.g. replicated file systems �...

Microarray analysis identifies a common set of cellular genes modulated by different HCV replicon clones (2008)

Ciccaglione, Anna, Marcantonio, Cinzia, Tritarelli, Elena, Tataseo, Paola, Ferraris, Alessandro, Bruni, Roberto, ...

Abstract Background Hepatitis C virus (HCV) RNA synthesis and protein expression affect cell homeostasis by modulation of gene expression. The impact of HCV replication on global cell transcription...

Deducing Interactions in Partially Unspecified Biological Systems (2008)

Paolo Baldan, Andrea Bracciali, Linda Brodo, Roberto Bruni

Abstract. We show how a symbolic approach to the semantics of process algebras can be fruitfully applied to the modeling and analysis of partially unspecified biological systems, i.e., systems whose...

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...

Event Structure Semantics for Dynamic Contextual Nets ⋆ (2008)

Roberto Bruni, Hernán Melgratti, Ugo Montanari

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...

Non-sequential behaviour of dynamic nets (2008)

Roberto Bruni, Hernán Melgratti

Abstract. Dynamic nets are an extension of Petri nets where the net topology may change dynamically. This is achieved by allowing (i) tokens to be coloured with place names (carried on as data), (ii)...

Abstract Flat Committed Join in Join 1 (2008)

Roberto Bruni, Hernán 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....

Non-sequential behaviour of dynamic nets (2008)

Roberto Bruni, Hernán Melgratti

Abstract. Dynamic nets are an extension of Petri nets where the net topology may change dynamically. This is achieved by allowing (i) tokens to be coloured with place names (carried on as data), (ii)...

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....

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

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...

Deducing Interactions in Partially UnspecifiedBiological Systems (2008)

Paolo Baldan, Andrea Bracciali, Linda Brodo, Roberto Bruni

Abstract. We show how a symbolic approach to the semantics of process alge-bras can be fruitfully applied to the modeling and analysis of partially unspecified biological systems, i.e., systems whose...

Deducing Interactions in Partially Unspecified Biological Systems (2008)

Paolo Baldan, Andrea Bracciali, Linda Brodo, Roberto Bruni

Abstract. We show how a symbolic approach to the semantics of process algebras can be fruitfully applied to the modeling and analysis of partially unspecified biological systems, i.e., systems whose...

Normal forms for stateless connectors (2008)

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...

Symbolic Equivalences for Open Systems\Delta (2008)

Paolo Baldan, Andrea Bracciali, Roberto Bruni, Dipartimento Informatica, Foscari Venezia

1 Introduction The widespread diffusion of web applications and mobile devices has shiftedthe attention to open systems, i.e., systems where mobile software components can be dynamically connected to...

Abstract CommUnity, Tiles and Connectors (2008)

Roberto Bruni

frameworks for the study of complex systems: The first is based on colimit constructions, the second on algebraic operators for composition. In CA, category objects model components and morphisms...

Normal forms for stateless connectors (2008)

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...

Abstract Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic 1 (2008)

Roberto Bruni, A Furio Honsell, B Marina Lenisa, Marino Miculan B

In recent years, logical frameworks and tile logic have been separately proposed by our research groups, respectively in Udine and in Pisa, as suitable metalanguages with higher-order features for...

Abstract CommUnity, Tiles and Connectors� (2008)

Roberto Bruni

frameworks for the study of complex systems: The first is based on colimit constructions, the second on algebraic operators for composition. In CA, category objects model components and morphisms...

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...

Open Systems (2008)

Paolo Baldan, Andrea Bracciali, Roberto Bruni

(1) Dipartimento di Informatica, Universit`a Ca ' Foscari di Venezia (2)

Abstract CMCS 2004 Preliminary Version Modeling Fresh Names in the π-calculus using Abstractions ⋆ (2008)

Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan

In this paper, we model fresh names in the π-calculus using abstractions with respect to a new binding operator θ. Both the theory and the metatheory of the π-calculus benefit from this simple...

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)

Roberto Bruni, Hernán 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 zero-safe’s agenda (2008)

Roberto Bruni, Ugo Montanari

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...

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...

Abstract TOSCA 2001 Preliminary Version Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic 1 (2007)

Roberto Bruni, A Furio Honsell, B Marina Lenisa, Marino Miculan B

In recent years, logical frameworks and tile logic have been separately proposed by our research groups, respectively in Udine and in Pisa, as suitable metalanguages with higher-order features for...

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...

F.: Some algebraic laws for spans (2007)

Roberto Bruni, Fabio Gadducci

This paper investigates some basic algebraic properties of the categories of spans and cospans (up to isomorphic supports) over the category Set of (small) sets and functions, analyzing the monoidal...

Dynamic (2007)

Roberto Bruni, Ugo Montanari, Vladimiro Sassone

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...

Modeling Fresh Names in the π-calculus Using Abstractions (2007)

Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan

In this paper, we model fresh names in the π-calculus using abstractions w.r.t. a new binding operator θ. Both the theory and the metatheory of the π-calculus benefit from...

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

Roberto Bruni, Ugo Montanari

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...

Modelling Dynamic Software Architectures using Typed Graph Grammars Abstract (2007)

Antonio Bucchiarone, Hernán Melgratti, Stefania Gnesi, Roberto Bruni

Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of the structure of a...

Deducing interactions in partially unspecified biological systems (2007)

Baldan, Paolo, Bracciali, Andrea, Brodo, Linda, Bruni, Roberto

We show how a symbolic approach to the semantics of process algebras can be fruitfully applied to the modeling and analysis of partially unspecified biological systems, i.e., systems whose components...

PRISMA: A mobile calculus with parametric synchronization (2006)

Roberto Bruni

Abstract. We present PRISMA, a parametric calculus that can be in-stantiated with different interaction policies, defined as synchronization algebras with mobility of names (SAMs). We define both...

Event structure semantics for nominal calculi (2006)

Roberto Bruni, Hernán Melgratti, Ugo Montanari

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...

Dynamic Graph Transformation Systems (2006)

Roberto Bruni, Hernán Melgratti

Abstract. We introduce an extension of Graph Grammars (GGs), called Dynamic Graph Grammars (DynGGs), where the right-hand side of a production can spawn fresh parts of the type graph and fresh...

PRISMA: A mobile calculus with parametric synchronization (2006)

Roberto Bruni

1 Introduction Since the pioneering papers by Robin Milner [16] and Tony Hoare [10], the useof process description languages has kept proliferating at an impressive rate. Though nowadays the most...

Translating Orc features into petri nets and the join calculus (2006)

Roberto Bruni, Hernán Melgratti, Emilio Tuosto

Abstract. Cook and Misra’s Orc is an elegant language for orchestrating distributed services, able to cover e.g. van der Aalst’s workflow patterns. We aim to understand the key novel features of...

PRISMA: A mobile calculus with parametric synchronization (2006)

Roberto Bruni, Ivan Lanese

Abstract. We present PRISMA, a parametric calculus that can be instantiated with different interaction policies, defined as synchronization algebras with mobility of names (SAMs). We define both...

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...

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...

I.: PRISMA: A parametric calculus based on synchronization algebras with mobility (2005)

Roberto Bruni, Ivan Lanese

Abstract. We present PRISMA, a parametric framework for modeling distributed and mobile systems with different communication policies, defined as synchronization algebras with mobility (SAMs). This...

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...

On graph(ic) encodings (2005)

Roberto Bruni, Ivan Lanese

Abstract. This paper is an informal summary of different encoding techniques from process calculi and distributed formalisms to graphic frameworks. The survey includes the use of solo diagrams, term...

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...

Symbolic equivalences for open systems (2005)

Paolo Baldan, Andrea Bracciali, Roberto Bruni

Abstract. Behavioural equivalences on open systems are usually defined by comparing system behaviour in all environments. Due to this “universal ” quantification over the possible hosting...

On graph(ic) encodings (2005)

Roberto Bruni, Ivan Lanese

Abstract. This paper is an informal summary of different encoding techniques from process calculi and distributed formalisms to graphic frameworks. The survey includes the use of solo diagrams, term...

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...

Summary 3: On Graph(ic) Encodings (2005)

Bruni, Roberto, Lanese, Ivan

This paper is an informal summary of different encoding techniques from process calculi and distributed formalisms to graphic frameworks. The survey includes the use of solo diagrams, term graphs,...

New insights on architectural connectors (2004)

Roberto Bruni, José Luiz Fiadeiro, Ivan Lanese, Antónia Lopes

Abstract This work is a first step toward the reconciliation of the two main approaches to composition in system modeling, namely the categorical one and the algebraic one. In particular, we present...

Modeling Fresh Names in the π-calculus Using Abstractions (2004)

Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan

In this paper, we model fresh names in the #-calculus using abstractions with respect to a new binding operator #. Both the theory and the metatheory of the #-calculus benefit from this simple...

Nested commits for mobile calculi: extending Join (2004)

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,...

Nested commits for mobile calculi: extending Join (2004)

Roberto Bruni, Hernán Melgratti, Ugo Montanari

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...

New insights on architectural connectors (2004)

Roberto Bruni, José Luiz Fiadeiro, Ivan Lanese, Antónia Lopes

Abstract This work is a first step toward the reconciliation of the two main approaches to composition in system modeling, namely the categorical one and the algebraic one. In particular, we present...

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....

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...

Generalized Rewrite Theories (2003)

Roberto Bruni And, Roberto Bruni, Jose Meseguer

Since its introduction, more than a decade ago, rewriting logic has attracted the interest of both theorists and practitioners, who have contributed in showing its generality as a semantic and...

Generalized Rewrite Theories (2003)

Roberto Bruni, José Meseguer

Abstract. Since its introduction, more than a decade ago, rewriting logic has attracted the interest of both theorists and practitioners, who have contributed in showing its generality as a semantic...

Generalized Rewrite Theories (2003)

Roberto Bruni, José Meseguer

Abstract. Since its introduction, more than a decade ago, rewriting logic has attracted the interest of both theorists and practitioners, who have contributed in showing its generality as a semantic...

Bisimulation by unification (2002)

Paolo Baldan, Andrea Bracciali, Roberto Bruni

Abstract. We propose a methodology for the analysis of open systems based on process calculi and bisimilarity. Open systems are seen as coordinators (i.e. terms with place-holders), that evolve when...

Bisimulation by unification (2002)

Paolo Baldan, Andrea Bracciali, Roberto Bruni

Abstract. We propose a methodology for the analysis of open systems based on process calculi and bisimilarity. Open systems are seen as coordinators (i.e. terms with place-holders), that evolve when...

Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic (2002)

Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan

In recent years, logical frameworks and tile logic have been separately proposed by our research groups, respectively in Udine and in Pisa, as suitable metalanguages with higher-order features for...

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...

Bisimulation by unification (2002)

Paolo Baldan, Andrea Bracciali, Roberto Bruni

Abstract We propose a methodology for the analysis of open systems based on process calculi and bisimilarity. Open systems are seen as coordinators (i.e. terms with place-holders), that evolve when...

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...

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)

Roberto Bruni, Ugo Montanari

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...

Two Algebraic Process Semantics for Contextual Nets (2001)

Roberto Bruni, Vladimiro Sassone

We show that the so-called `Petri nets are monoids' approach initiated by Meseguer and Montanari can be extended from ordinary place/transition Petri nets to contextual nets by considering...

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)

Roberto Bruni, Ugo Montanari

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...

Comparing higher-order encodings in logical frameworks and tile logic (2001)

Roberto Bruni, A Furio Honsell, B Marina Lenisa, Marino Miculan B

Abstract In recent years, logical frameworks and tile logic have been separately proposed by our research groups, respectively in Udine and in Pisa, as suitable metalanguages with higher-order...

Transactions and zero-safe nets (2001)

Roberto Bruni, Ugo Montanari

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.,...

Executing Transactions in Zero-Safe Nets (2000)

Roberto Bruni, Ugo Montanari

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...

Normal Forms for Algebras of Connections (2000)

Roberto Bruni, Fabio Gadducci, Ugo Montanari

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...

Some Algebraic Properties of (Co)Spans (2000)

Roberto Bruni, Fabio Gadducci

The paper investigates the algebraic properties of the categories of spans and cospans (up to isomorphic supports) over the category Set of (small) sets and functions. We analyze the monoidal...

Algebraic Models for Contextual Nets (2000)

Roberto Bruni, Vladimiro Sassone

We extend the algebraic approach of Meseguer and Montanari from ordinary place/transition Petri nets to contextual nets, covering both the collective and the individual token philosophy uniformly...

Normal Forms for Algebras of Connections (2000)

Roberto Bruni, Fabio Gadducci, Ugo Montanari

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...

and (2000)

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

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...

Tile Logic for Synchronized Rewriting of Concurrent Systems (1999)

Roberto Bruni, Prof Ugo Montanari

Tile logic is a framework to reason about the dynamic evolution of concurrent systems in a modular way. It extends rcwritig logic (in the unconditional case) by adding rewriting synchronization and...

Normal Forms for Partitions and Relations (1999)

Roberto Bruni, Fabio Gadducci, Ugo Montanari

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...

Normal Forms for Partitions and Relations (1999)

Roberto Bruni, Fabio Gadducci, Ugo Montanari

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...

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

Roberto Bruni, José Meseguer, Ugo Montanari

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)

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...

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

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...

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

Roberto Bruni, Ugo Montanari

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...

Executable Tile Specifications for Process Calculi (1999)

Roberto Bruni, José Meseguer, Ugo Montanari

. 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...

Normal Forms for Partitions and Relations (1999)

Roberto Bruni, Fabio Gadducci, Ugo Montanari

. 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...

Tile Logic for Synchronized Rewriting of Concurrent Systems (1999)

Roberto Bruni

Tile logic is a framework to reason about the dynamic evolution of concurrent systems in a modular way. It extends rewriting logic (in the unconditional case) by adding rewriting synchronization and...

Executable Tile Specifications for Process Calculi (1999)

Roberto Bruni, José Meseguer, Ugo Montanari

. 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...

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

Roberto Bruni, Ugo Montanari

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...

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...

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

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...

A Logic for Modular Descriptions of Asynchronous and Synchronized Concurrent Systems (1998)

Roberto Bruni

Tile logic is a framework to reason about the dynamic evolution of concurrent systems in a modular way, and it extends rewriting logic (in the unconditional case) by rewriting synchronization and...

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

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...

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

Roberto Bruni, Ugo Montanari

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...

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

Roberto Bruni, Ugo Montanari

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...

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

Roberto Bruni, José Meseguer, Ugo Montanari

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...

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...

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

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...