Theoretical Computer Science
6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings
Page
%P
24 Result(s)
within
Vladimiro Sassone
English
Software Engineering/Programming and Operating Systems
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Trust in Anonymity Networks
Anonymity is a security property of paramount importance, as we move steadily towards a wired, online community. Its import touches upon subjects as different as eGovernance, eBusiness and eLeisure, as well as...
-
Chapter and Conference Paper
Towards a Formal Framework for Computational Trust
We define a mathematical measure for the quantitative comparison of probabilistic computational trust systems, and use it to compare a well-known class of algorithms based on the so-called beta model. The main...
-
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
Automata, Languages and Programming
33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I
-
Book and Conference Proceedings
Automata, Languages and Programming
33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II
-
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
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 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
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
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...
-
Chapter and Conference Paper
Algebraic Models for Contextual Nets
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 along the two in...
-
Chapter
Representation theorems for Petri Nets
This paper retraces, collects, summarises, and mildly extends the contributions of the authors — both together and individually — on the theme of representing the space of computations of Petri nets in its mat...
-
Book and Conference Proceedings
CONCUR '96: Concurrency Theory
7th International Conference Pisa, Italy, August 26–29, 1996 Proceedings
-
Chapter and Conference Paper
Comparing transition systems with independence and asynchronous transition systems
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They differ for the cho...
