#### Filter Results:

- Full text PDF available (129)

#### Publication Year

1991

2017

- This year (7)
- Last 5 years (24)
- Last 10 years (48)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Massimo Merro, Vladimiro Sassone
- CONCUR
- 2002

We provide a novel type system for Bugliesi et al.’s Boxed Ambients that combines value subtyping with mobility types. The former is based on read/write exchange types, the latter builds on the notion of ambient group. Mobility types allow to specify where an ambient is allowed to stay, closing existing expressiveness gaps in the literature at no additional… (More)

- Marco Carbone, Mogens Nielsen, Vladimiro Sassone
- SEFM
- 2003

We propose a formal model of trust informed by the Global Computing scenario and focusing on the aspects of trust formation, evolution, and propagation. The model is based on a novel notion of trust structures which, building on concepts from trust management and domain theory, feature at the same time a trust and an information partial order.

- Vladimiro Sassone, Mogens Nielsen, Glynn Winskel
- Theor. Comput. Sci.
- 1996

Abstract Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. In this paper, we move a step towards a classification… (More)

- Michele Bugliesi, Silvia Crafa, Massimo Merro, Vladimiro Sassone
- Inf. Comput.
- 2005

Boxed Ambients (BA) replace Mobile Ambients’ open capability with communication primitives acting across ambient boundaries. The expressiveness of the new model of communication is achieved at the price of interferences that affect message reception and whose resolution requires synchronisation of activities at multiple, distributed locations. We study a… (More)

- Vladimiro Sassone, Pawel Sobocinski
- 20th Annual IEEE Symposium on Logic in Computer…
- 2005

The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for semantic models with an underlying reduction semantics. The derivation procedure requires the presence of certain colimits (or, more usually and generally, bicolimits) which need… (More)

- Vladimiro Sassone, Pawel Sobocinski
- Nord. J. Comput.
- 2003

We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for process calculi where terms are viewed modulo structural congruence. We develop their basic properties and show that bisimulation on the LTS derived via GRPOs is a congruence,… (More)

- Bartek Klin, Vladimiro Sassone
- FoSSaCS
- 2008

A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeterministic processes. Stochastic bisimilarity is guaranteed a congruence for systems defined by SGSOS rules. Associativity of parallel composition in stochastic process algebras is also… (More)

- Mikkel Bundgaard, Vladimiro Sassone
- PPDP
- 2006

<i>Bigraphs</i> have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own communication links and nested locations. In this paper we examine a presentation of type systems on bigraphical systems using the notion of sorting. We focus our attention on the <i>typed polyadic… (More)

Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical ‘place’ graph for locations and a ‘link’ (hyper-)graph for connections. In a previous work (submitted elsewhere and yet unpublished), we introduced a logic for bigraphical structures… (More)

- Ugo Montanari, Vladimiro Sassone
- Fundam. Inform.
- 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. α.τ.β.nil and α.β.nil are woc but τ.β.nil and β.nil are not. This fact prevent us from characterizing CCS semantics (when τ is considered invisible) as a final algebra,… (More)