Automata, Languages and Programming
33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I
Page
%P
56 Result(s)
within
Vladimiro Sassone
English
-
Chapter and Conference Paper
Semantic Barbs and Biorthogonality
We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory of barbs and demonstrate its ro...
-
Book and Conference Proceedings
-
Book and Conference Proceedings
Automata, Languages and Programming
33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II
-
Book and Conference Proceedings
Foundations of Software Science and Computational Structures
8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings
-
Chapter and Conference Paper
Spatial Logics for Bigraphs
Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a li...
-
Chapter and Conference Paper
Labels from Reductions: Towards a General Theory
We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.
-
Chapter and Conference Paper
A Calculus for Trust Management
We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its legal behaviour, and with a ...
-
Chapter and Conference Paper
A Survey of Name-Passing Calculi and Crypto-Primitives
The paper surveys the literature on high-level name-passing process calculi, and their extensions with cryptographic primitives. The survey is by no means exhaustive, for essentially two reasons. First, in try...
-
Chapter and Conference Paper
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access cont...
-
Chapter and Conference Paper
Deriving Bisimulation Congruences: 2-Categories Vs Precategories
G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems. This paper deve...
-
Chapter and Conference Paper
A Calculus of Bounded Capacities
Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space usage in the context of an ambient-like...
-
Chapter and Conference Paper
Secrecy in Untrusted Networks
We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies and security protocols over d...
-
Chapter and Conference Paper
Algebraic Theories for Contextual Pre-nets
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 somewhat f...
-
Chapter and Conference Paper
Communication Interference in Mobile Boxed Ambients
Boxed Ambients (BA) replace Mobile Ambients’open capability with communication primitives acting across ambient boundaries. Expressiveness is achieved at the price of communication interferences on message rec...
-
Chapter and Conference Paper
Ty** and Subty** Mobility in Boxed Ambients*
We provide a novel type system for Bugliesi et al.’s Boxed Ambients that combines value subty** with mobility types. The former is based on read/write exchange types, the latter builds on the notion of ambient ...
-
Chapter and Conference Paper
A Calculus of Mobile Resources*
We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints,an d which are ...
-
Chapter and Conference Paper
Towards a Notion of Distributed Time for Petri Nets
We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty i...
-
Chapter and Conference Paper
Properties of Distributed Timed-Arc Petri Nets
In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This ...
-
Chapter
Two Algebraic Process Semantics for Contextual Nets
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 suitable non-free monoi...
-
Chapter and Conference Paper
High-Level Petri Nets as Type Theories in the Join Calculus
We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiv...
