Foundations of Software Science and Computational Structures (2008)
Special issue of Theoretical Computer Science dedicated to Fossacs 2005
Foundations of Software Science and Computational Structures (2008)
Special issue of Theoretical Computer Science dedicated to Fossacs 2005
Structural Operational Semantics for Stochastic Process Calculi (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....
Structural Operational Semantics for Stochastic Process Calculi (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....
Overview of the contents of "Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005"
Overview of the contents of "Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005"
Overvew of the contents of the volume "Semantic and logical foundations of global computing"
Overvew of the contents of the volume "Semantic and logical foundations of global computing"
Semantic and logical foundations of global computing (2007)
Special issue of Theoretical Computer Science dedicated to the EU programme on Global Computing
Static BiLog: a Unifying Language for Spatial Structures (2007)
Conforti, G., Macedonio, D., Sassone, V.
Aiming at a unified view of the logics describing spatial structures, we introduce a general framework, BiLog, whose formulae characterise monoidal categories. As a first instance of the framework...
Static BiLog: a Unifying Language for Spatial Structures (2007)
Conforti, G., Macedonio, D., Sassone, V.
Aiming at a unified view of the logics describing spatial structures, we introduce a general framework, BiLog, whose formulae characterise monoidal categories. As a first instance of the framework...
Space-Aware Ambients and Processes (2007)
Barbanera, F., Bugliesi, M., Dezani, M., Sassone, V.
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...
A Logical Framework for Reputation Systems (2007)
Krukow, K., Nielsen, M., Sassone, V.
Reputation systems are meta systems that record, aggregate and distribute information about the past behaviour of principals in an application. Typically, these applications are large-scale open...
Semantic Barbs and Biorthogonality (2007)
Rathke, J., Sassone, V., Sobocinski, P.
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...
A Bayesian model for event-based trust (2007)
Nielsen, M., Krukow, K., Sassone, V.
The application scenarios envisioned for ‘global ubiquitous computing’ have unique re- quirements that are often incompatible with traditional security paradigms. One alternative currently being...
Space-Aware Ambients and Processes (2007)
Barbanera, F., Bugliesi, M., Dezani, M., Sassone, V.
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...
A Logical Framework for Reputation Systems (2007)
Krukow, K., Nielsen, M., Sassone, V.
Reputation systems are meta systems that record, aggregate and distribute information about the past behaviour of principals in an application. Typically, these applications are large-scale open...
Semantic Barbs and Biorthogonality (2007)
Rathke, J., Sassone, V., Sobocinski, P.
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...
A Bayesian model for event-based trust (2007)
Nielsen, M., Krukow, K., Sassone, V.
The application scenarios envisioned for ‘global ubiquitous computing’ have unique re- quirements that are often incompatible with traditional security paradigms. One alternative currently being...
Space-Aware Ambients and Processes (2007)
Barbanera, F., Bugliesi, M., Dezani, M., Sassone, V.
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...
A Logical Framework for Reputation Systems (2007)
Krukow, K., Nielsen, M., Sassone, V.
Reputation systems are meta systems that record, aggregate and distribute information about the past behaviour of principals in an application. Typically, these applications are large-scale open...
Semantic Barbs and Biorthogonality (2007)
Rathke, J., Sassone, V., Sobocinski, P.
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...
A Bayesian model for event-based trust (2007)
Nielsen, M., Krukow, K., Sassone, V.
The application scenarios envisioned for ‘global ubiquitous computing’ have unique re- quirements that are often incompatible with traditional security paradigms. One alternative currently being...
Towards a Formal Framework for Computational Trust (2007)
Sassone, V., Nielsen, M., Krukow, K.
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...
Towards a Formal Framework for Computational Trust (2007)
Sassone, V., Nielsen, M., Krukow, K.
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...
Semantic barbs: what's in an observation? (talk) (2006)
Talk given at ECS, Soton on 6.12.06
Semantic barbs: what's in an observation? (talk) (2006)
Talk given at ECS, Soton on 6.12.06
Semantic barbs: what's in an observation? (talk) (2006)
Talk given at ECS, Soton on 6.12.06
Elements towards a foundation of computational trust (talk) (2006)
Talk given at FMCO, Amsterdam on 10.11.06 and at ECS, Soton on 22.11.06
Elements towards a foundation of computational trust (talk) (2006)
Talk given at FMCO, Amsterdam on 10.11.06 and at ECS, Soton on 22.11.06
Elements towards a foundation of computational trust (talk) (2006)
Talk given at FMCO, Amsterdam on 10.11.06 and at ECS, Soton on 22.11.06
Role-based access control for a distributed calculus (2006)
Braghin, C., Gorla, D., Sassone, V.
Role-based access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of role in the assignment of...
A Hybrid Intuitionistic Logic: Semantics and Decidability (2006)
Chadha, R., Macedonio, D., Sassone, V.
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced by Jia and Walker. The modalities of the logic allow validation of properties in a...
BiLog: Spatial Logics for Bigraphs (2006)
Conforti, G., Macedonio, D., Sassone, V.
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, $\pi$-calculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for...
BiLog - A Framework for Structural Logics (talk) (2006)
Talk given at Forum on Separation Logics, Cambridge 14.03.06
Typed polyadic pi-calculus in bigraphs (2006)
Bigraphs 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...
Inferring Dynamic Credentials for Role-based Trust Management (2006)
Gorla, D., Hennessy, M., Sassone, V.
The topic of this paper is the role-based trust-management language RT_0, a formalism inspired by logic programming that handles trust in large scale, decentralised systems. We provide a purely...
Role-based access control for a distributed calculus (2006)
Braghin, C., Gorla, D., Sassone, V.
Role-based access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of role in the assignment of...
A Hybrid Intuitionistic Logic: Semantics and Decidability (2006)
Chadha, R., Macedonio, D., Sassone, V.
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced by Jia and Walker. The modalities of the logic allow validation of properties in a...
BiLog: Spatial Logics for Bigraphs (2006)
Conforti, G., Macedonio, D., Sassone, V.
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, $\pi$-calculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for...
BiLog - A Framework for Structural Logics (talk) (2006)
Talk given at Forum on Separation Logics, Cambridge 14.03.06
Typed polyadic pi-calculus in bigraphs (2006)
Bigraphs 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...
Inferring Dynamic Credentials for Role-based Trust Management (2006)
Gorla, D., Hennessy, M., Sassone, V.
The topic of this paper is the role-based trust-management language RT_0, a formalism inspired by logic programming that handles trust in large scale, decentralised systems. We provide a purely...
Role-based access control for a distributed calculus (2006)
Braghin, C., Gorla, D., Sassone, V.
Role-based access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of role in the assignment of...
A Hybrid Intuitionistic Logic: Semantics and Decidability (2006)
Chadha, R., Macedonio, D., Sassone, V.
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced by Jia and Walker. The modalities of the logic allow validation of properties in a...
BiLog: Spatial Logics for Bigraphs (2006)
Conforti, G., Macedonio, D., Sassone, V.
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, $\pi$-calculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for...
BiLog - A Framework for Structural Logics (talk) (2006)
Talk given at Forum on Separation Logics, Cambridge 14.03.06
Typed polyadic pi-calculus in bigraphs (2006)
Bigraphs 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...
Inferring Dynamic Credentials for Role-based Trust Management (2006)
Gorla, D., Hennessy, M., Sassone, V.
The topic of this paper is the role-based trust-management language RT_0, a formalism inspired by logic programming that handles trust in large scale, decentralised systems. We provide a purely...
Jeeg: Temporal Constraints for the Synchronization of Concurrent Objects (2005)
We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the `business' and the `synchronization'...
Locating Reactions using 2-Categories (2005)
Groupoidal 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...
Observational Congruences for Dynamically Reconfigurable Tile Systems (2005)
Bruni, R., Montanari, U., Sassone, V.
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...
A Calculus of Trust Management (2005)
Carbone, M., Nielsen, M., Sassone, V.
We discuss a formal model for trust in Global Computing scenarios, focusing on the aspects of trust formation, evolution, and propagation. We focus on a particular abstract model, and illustrate its...
Communication and Mobility Control in Boxed Ambients (2005)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.
Boxed Ambients (BA) replace Mobile Ambients' open capability with communication primitives acting across ambient boundaries. The expressiveness of the new communication model is achieved at the price...
Security Policies as Membranes in Systems for Global Computing (2005)
Gorla, D., Hennessy, M., Sassone, V.
We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane which...
Labels from Reductions: Towards a General Theory (2005)
Klin, B., Sassone, V., Sobocinski, P.
We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.
A Congruence for Petri Nets (2005)
We introduce a way of viewing Petri nets as open systems. This is done by considering a bicategory of cospans over a category of p/t nets and embeddings. We derive a labelled transition system (LTS)...
Reactive Systems over Cospans (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...
Spatial Logics for Bigraphs (2005)
Conforti, G., Macedonio, D., Sassone, V.
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...
Bigraphical Logics for XML (2005)
Conforti, G., Macedonio, D., Sassone, V.
Bigraphs have been recently proposed as a meta-model for global computing resources; they are built orthogonally on two structures: a hierarchical ‘place’ graph for locations and a ‘link’...
A Formal Framework for Concrete Reputation Systems (2005)
Krukow, K., Nielsen, M., Sassone, V.
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions about interaction....
Talk given at ECS Southampton, 7.7.05
Labels from Reductions - the theory of relative pushouts (talk) (2005)
Talk given at CALCO 2005 (3.09.05)
Jeeg: Temporal Constraints for the Synchronization of Concurrent Objects (2005)
We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the `business' and the `synchronization'...
Locating Reactions using 2-Categories (2005)
Groupoidal 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...
Observational Congruences for Dynamically Reconfigurable Tile Systems (2005)
Bruni, R., Montanari, U., Sassone, V.
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...
A Calculus of Trust Management (2005)
Carbone, M., Nielsen, M., Sassone, V.
We discuss a formal model for trust in Global Computing scenarios, focusing on the aspects of trust formation, evolution, and propagation. We focus on a particular abstract model, and illustrate its...
Communication and Mobility Control in Boxed Ambients (2005)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.
Boxed Ambients (BA) replace Mobile Ambients' open capability with communication primitives acting across ambient boundaries. The expressiveness of the new communication model is achieved at the price...
Security Policies as Membranes in Systems for Global Computing (2005)
Gorla, D., Hennessy, M., Sassone, V.
We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane which...
Labels from Reductions: Towards a General Theory (2005)
Klin, B., Sassone, V., Sobocinski, P.
We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.
A Congruence for Petri Nets (2005)
We introduce a way of viewing Petri nets as open systems. This is done by considering a bicategory of cospans over a category of p/t nets and embeddings. We derive a labelled transition system (LTS)...
Reactive Systems over Cospans (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...
Spatial Logics for Bigraphs (2005)
Conforti, G., Macedonio, D., Sassone, V.
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...
Bigraphical Logics for XML (2005)
Conforti, G., Macedonio, D., Sassone, V.
Bigraphs have been recently proposed as a meta-model for global computing resources; they are built orthogonally on two structures: a hierarchical ‘place’ graph for locations and a ‘link’...
A Formal Framework for Concrete Reputation Systems (2005)
Krukow, K., Nielsen, M., Sassone, V.
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions about interaction....
Talk given at ECS Southampton, 7.7.05
Labels from Reductions - the theory of relative pushouts (talk) (2005)
Talk given at CALCO 2005 (3.09.05)
Jeeg: Temporal Constraints for the Synchronization of Concurrent Objects (2005)
We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the `business' and the `synchronization'...
Locating Reactions using 2-Categories (2005)
Groupoidal 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...
Observational Congruences for Dynamically Reconfigurable Tile Systems (2005)
Bruni, R., Montanari, U., Sassone, V.
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...
A Calculus of Trust Management (2005)
Carbone, M., Nielsen, M., Sassone, V.
We discuss a formal model for trust in Global Computing scenarios, focusing on the aspects of trust formation, evolution, and propagation. We focus on a particular abstract model, and illustrate its...
Communication and Mobility Control in Boxed Ambients (2005)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.
Boxed Ambients (BA) replace Mobile Ambients' open capability with communication primitives acting across ambient boundaries. The expressiveness of the new communication model is achieved at the price...
Security Policies as Membranes in Systems for Global Computing (2005)
Gorla, D., Hennessy, M., Sassone, V.
We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane which...
Labels from Reductions: Towards a General Theory (2005)
Klin, B., Sassone, V., Sobocinski, P.
We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.
A Congruence for Petri Nets (2005)
We introduce a way of viewing Petri nets as open systems. This is done by considering a bicategory of cospans over a category of p/t nets and embeddings. We derive a labelled transition system (LTS)...
Reactive Systems over Cospans (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...
Spatial Logics for Bigraphs (2005)
Conforti, G., Macedonio, D., Sassone, V.
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...
Bigraphical Logics for XML (2005)
Conforti, G., Macedonio, D., Sassone, V.
Bigraphs have been recently proposed as a meta-model for global computing resources; they are built orthogonally on two structures: a hierarchical ‘place’ graph for locations and a ‘link’...
A Formal Framework for Concrete Reputation Systems (2005)
Krukow, K., Nielsen, M., Sassone, V.
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions about interaction....
Talk given at ECS Southampton, 7.7.05
Labels from Reductions - the theory of relative pushouts (talk) (2005)
Talk given at CALCO 2005 (3.09.05)
A Distributed Kripke Semantics (2004)
Chadha, R., Macedonio, D., Sassone, V.
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [10]. We extend the Kripke semantics of intuitionistic logic, enriching each possible...
A Distributed Kripke Semantics (2004)
Chadha, R., Macedonio, D., Sassone, V.
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [10]. We extend the Kripke semantics of intuitionistic logic, enriching each possible...
A Distributed Kripke Semantics (2004)
Chadha, R., Macedonio, D., Sassone, V.
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [10]. We extend the Kripke semantics of intuitionistic logic, enriching each possible...
Science for Global Ubiquitous Computing (2004)
Kwiatkowska, M., Milner, R., Sassone, V.
This paper describes an initiative to provide theories that can underlie the development of the Global Ubiquitous Computer, the network of ubiquitous computing devices that will pervade the civilised...
Name-passing calculi and crypto-primitives: A survey (2004)
Bugliesi, M., Castagna, G., Crafa, S., Focardi, R., Sassone, V.
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....
The Algebraic Structure of Petri Nets (2004)
This survey retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the...
Engineering Trust-based Software Intensive Systems (2004)
Abstract of a keynote speech given at the Strategic Research Workshop on Engineering Software Intensive Systems.
The Inheritance Anomaly: Ten years after (2004)
The term inheritance anomaly was coined in 1993 by Matsuoka and Yonezawa [15] to refer to the problems arising by the coexistence of inheritance and concurrency in concurrent object oriented...
A Dependently Typed Ambient Calculus (2004)
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...
A Distributed Calculus for Role-Based Access Control (2004)
Braghin, C., Gorla, D., Sassone, V.
Role-based access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of role in the assignment of...
A Calculus of Trust Management (2004)
Carbone, M., Nielsen, M., Sassone, V.
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,...
Congruences for Contextual Graph-Rewriting (talk) (2004)
Talk given at Dagstuhl Graph Rewriting meeting 7.06.04 Repeated at LICS 2005
Background and Structure of a Coordination Action (talk) (2004)
Talk given at EATCS meeting, Aarhus 22.01.04
A dependently typed ambient calculus (talk) (2004)
Talk given at Global Computing Review Meeting, Trento 9.03.04
Context-Aware Software-Intensive Systems - An autonomic approach (talk) (2004)
Talk given at Joint NSF/EU Workshop Engineering Software-Intensive Systems, Edinburgh 22.05.04
Trust and Concurrency - A Theory Contribution to Ubiquitous Computing (talk) (2004)
Course given at UK UbiNet Summer School 2004, Edinburgh 14.09.04
Foundations of Global Computing - A Personal Perspective (talk) (2004)
Talk given at Swansea, March 2004
Global Computing II - A new FET Programme for FP6 (talk) (2004)
Talk given at FET 2004 Information Day, Brussels 4.06.04
A Calculus for Trust Management (talk) (2004)
Talk given at GC 2004: MyThS/MIKADO/DART Meeting, Venice 16.06.04
Security Policies as Membranes in Systems for Global Computing (talk) (2004)
Talk given at GC 2004: MyThS/MIKADO/DART Meeting, Venice 15.06.04
A Distributed Calculus for Role-Based Access Control (talk) (2004)
Talk given at CSFW 2004, Pacific Grove 28.6.04
Science for Global Ubiquitous Computing (2004)
Kwiatkowska, M., Milner, R., Sassone, V.
This paper describes an initiative to provide theories that can underlie the development of the Global Ubiquitous Computer, the network of ubiquitous computing devices that will pervade the civilised...
Name-passing calculi and crypto-primitives: A survey (2004)
Bugliesi, M., Castagna, G., Crafa, S., Focardi, R., Sassone, V.
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....
The Algebraic Structure of Petri Nets (2004)
This survey retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the...
Engineering Trust-based Software Intensive Systems (2004)
Abstract of a keynote speech given at the Strategic Research Workshop on Engineering Software Intensive Systems.
The Inheritance Anomaly: Ten years after (2004)
The term inheritance anomaly was coined in 1993 by Matsuoka and Yonezawa [15] to refer to the problems arising by the coexistence of inheritance and concurrency in concurrent object oriented...
A Dependently Typed Ambient Calculus (2004)
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...
A Distributed Calculus for Role-Based Access Control (2004)
Braghin, C., Gorla, D., Sassone, V.
Role-based access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of role in the assignment of...
A Calculus of Trust Management (2004)
Carbone, M., Nielsen, M., Sassone, V.
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,...
Congruences for Contextual Graph-Rewriting (talk) (2004)
Talk given at Dagstuhl Graph Rewriting meeting 7.06.04 Repeated at LICS 2005
Background and Structure of a Coordination Action (talk) (2004)
Talk given at EATCS meeting, Aarhus 22.01.04
A dependently typed ambient calculus (talk) (2004)
Talk given at Global Computing Review Meeting, Trento 9.03.04
Context-Aware Software-Intensive Systems - An autonomic approach (talk) (2004)
Talk given at Joint NSF/EU Workshop Engineering Software-Intensive Systems, Edinburgh 22.05.04
Trust and Concurrency - A Theory Contribution to Ubiquitous Computing (talk) (2004)
Course given at UK UbiNet Summer School 2004, Edinburgh 14.09.04
Foundations of Global Computing - A Personal Perspective (talk) (2004)
Talk given at Swansea, March 2004
Global Computing II - A new FET Programme for FP6 (talk) (2004)
Talk given at FET 2004 Information Day, Brussels 4.06.04
A Calculus for Trust Management (talk) (2004)
Talk given at GC 2004: MyThS/MIKADO/DART Meeting, Venice 16.06.04
Security Policies as Membranes in Systems for Global Computing (talk) (2004)
Talk given at GC 2004: MyThS/MIKADO/DART Meeting, Venice 15.06.04
A Distributed Calculus for Role-Based Access Control (talk) (2004)
Talk given at CSFW 2004, Pacific Grove 28.6.04
Science for Global Ubiquitous Computing (2004)
Kwiatkowska, M., Milner, R., Sassone, V.
This paper describes an initiative to provide theories that can underlie the development of the Global Ubiquitous Computer, the network of ubiquitous computing devices that will pervade the civilised...
Name-passing calculi and crypto-primitives: A survey (2004)
Bugliesi, M., Castagna, G., Crafa, S., Focardi, R., Sassone, V.
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....
The Algebraic Structure of Petri Nets (2004)
This survey retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the...
Engineering Trust-based Software Intensive Systems (2004)
Abstract of a keynote speech given at the Strategic Research Workshop on Engineering Software Intensive Systems.
The Inheritance Anomaly: Ten years after (2004)
The term inheritance anomaly was coined in 1993 by Matsuoka and Yonezawa [15] to refer to the problems arising by the coexistence of inheritance and concurrency in concurrent object oriented...
A Dependently Typed Ambient Calculus (2004)
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...
A Distributed Calculus for Role-Based Access Control (2004)
Braghin, C., Gorla, D., Sassone, V.
Role-based access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of role in the assignment of...
A Calculus of Trust Management (2004)
Carbone, M., Nielsen, M., Sassone, V.
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,...
Congruences for Contextual Graph-Rewriting (talk) (2004)
Talk given at Dagstuhl Graph Rewriting meeting 7.06.04 Repeated at LICS 2005
Background and Structure of a Coordination Action (talk) (2004)
Talk given at EATCS meeting, Aarhus 22.01.04
A dependently typed ambient calculus (talk) (2004)
Talk given at Global Computing Review Meeting, Trento 9.03.04
Context-Aware Software-Intensive Systems - An autonomic approach (talk) (2004)
Talk given at Joint NSF/EU Workshop Engineering Software-Intensive Systems, Edinburgh 22.05.04
Trust and Concurrency - A Theory Contribution to Ubiquitous Computing (talk) (2004)
Course given at UK UbiNet Summer School 2004, Edinburgh 14.09.04
Foundations of Global Computing - A Personal Perspective (talk) (2004)
Talk given at Swansea, March 2004
Global Computing II - A new FET Programme for FP6 (talk) (2004)
Talk given at FET 2004 Information Day, Brussels 4.06.04
A Calculus for Trust Management (talk) (2004)
Talk given at GC 2004: MyThS/MIKADO/DART Meeting, Venice 16.06.04
Security Policies as Membranes in Systems for Global Computing (talk) (2004)
Talk given at GC 2004: MyThS/MIKADO/DART Meeting, Venice 15.06.04
A Distributed Calculus for Role-Based Access Control (talk) (2004)
Talk given at CSFW 2004, Pacific Grove 28.6.04
Deriving Bisimulation Congruences using 2-Categories (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...
Global Computing II. Terms of reference for the FP6-EU-FET call. (2003)
The European Commission has decided to continue and develop its FET “Global Computing,” and will shortly announce the opening of “Global Computing II.” The call is expected in May 2004, with...
Temporal Constraints for Concurrent Object Synchronisation (2003)
This is a brief introduction to the language Jeeg (presented as an invited talk at WOODS 2003)
Deriving Bisimulation Congruences: 2-categories vs precategories (2003)
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....
Secrecy in Untrusted Networks (2003)
Bugliesi, M., Crafa, S., Prelic, A., Sassone, V.
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...
A Formal Model for Trust in Dynamic Networks (2003)
Carbone, M., Nielsen, M., Sassone, V.
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...
Algebraic theories for contextual pre-nets (2003)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
A Calculus of Bounded Capacities (2003)
Barbanera, F., Bugliesi, M., Dezani, M., Sassone, V.
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...
Subtyping for Access Control (talk) (2003)
Talk given at MyThS review meeting, Trento Feb 03
A 2-Categorical Approach to Bisimulation Congruences (talk) (2003)
Talk given at FMM, Marseille 7.09.03
Deriving Bisimulation Congruences: 2-categories vs precategories (talk) (2003)
Talk given at FOSSACS 2003.
Temporal Constraints for Concurrent Object Synchronisation (talk) (2003)
Talk given at WOOD 2003 (12.04.03)
A Calculus of Bounded Capacities (talk) (2003)
Talk given at IFIP WG 2.2, Amsterdam 16.05.03
Calculi and Types for Global Computing (talk) (2003)
Course given at Foundations of Security Summer School, Oregon June 2003
A Role for Theory in UbiNet (talk) (2003)
Talk given at 1st UK UbiNet Workshop, London 26.09.03
Deriving Bisimulation Congruences using 2-Categories (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...
Global Computing II. Terms of reference for the FP6-EU-FET call. (2003)
The European Commission has decided to continue and develop its FET “Global Computing,” and will shortly announce the opening of “Global Computing II.” The call is expected in May 2004, with...
Temporal Constraints for Concurrent Object Synchronisation (2003)
This is a brief introduction to the language Jeeg (presented as an invited talk at WOODS 2003)
Deriving Bisimulation Congruences: 2-categories vs precategories (2003)
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....
Secrecy in Untrusted Networks (2003)
Bugliesi, M., Crafa, S., Prelic, A., Sassone, V.
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...
A Formal Model for Trust in Dynamic Networks (2003)
Carbone, M., Nielsen, M., Sassone, V.
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...
Algebraic theories for contextual pre-nets (2003)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
A Calculus of Bounded Capacities (2003)
Barbanera, F., Bugliesi, M., Dezani, M., Sassone, V.
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...
Subtyping for Access Control (talk) (2003)
Talk given at MyThS review meeting, Trento Feb 03
A 2-Categorical Approach to Bisimulation Congruences (talk) (2003)
Talk given at FMM, Marseille 7.09.03
Deriving Bisimulation Congruences: 2-categories vs precategories (talk) (2003)
Talk given at FOSSACS 2003.
Temporal Constraints for Concurrent Object Synchronisation (talk) (2003)
Talk given at WOOD 2003 (12.04.03)
A Calculus of Bounded Capacities (talk) (2003)
Talk given at IFIP WG 2.2, Amsterdam 16.05.03
Calculi and Types for Global Computing (talk) (2003)
Course given at Foundations of Security Summer School, Oregon June 2003
A Role for Theory in UbiNet (talk) (2003)
Talk given at 1st UK UbiNet Workshop, London 26.09.03
Deriving Bisimulation Congruences using 2-Categories (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...
Global Computing II. Terms of reference for the FP6-EU-FET call. (2003)
The European Commission has decided to continue and develop its FET “Global Computing,” and will shortly announce the opening of “Global Computing II.” The call is expected in May 2004, with...
Temporal Constraints for Concurrent Object Synchronisation (2003)
This is a brief introduction to the language Jeeg (presented as an invited talk at WOODS 2003)
Deriving Bisimulation Congruences: 2-categories vs precategories (2003)
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....
Secrecy in Untrusted Networks (2003)
Bugliesi, M., Crafa, S., Prelic, A., Sassone, V.
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...
A Formal Model for Trust in Dynamic Networks (2003)
Carbone, M., Nielsen, M., Sassone, V.
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...
Algebraic theories for contextual pre-nets (2003)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
A Calculus of Bounded Capacities (2003)
Barbanera, F., Bugliesi, M., Dezani, M., Sassone, V.
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...
Subtyping for Access Control (talk) (2003)
Talk given at MyThS review meeting, Trento Feb 03
A 2-Categorical Approach to Bisimulation Congruences (talk) (2003)
Talk given at FMM, Marseille 7.09.03
Deriving Bisimulation Congruences: 2-categories vs precategories (talk) (2003)
Talk given at FOSSACS 2003.
Temporal Constraints for Concurrent Object Synchronisation (talk) (2003)
Talk given at WOOD 2003 (12.04.03)
A Calculus of Bounded Capacities (talk) (2003)
Talk given at IFIP WG 2.2, Amsterdam 16.05.03
Calculi and Types for Global Computing (talk) (2003)
Course given at Foundations of Security Summer School, Oregon June 2003
A Role for Theory in UbiNet (talk) (2003)
Talk given at 1st UK UbiNet Workshop, London 26.09.03
A Calculus of Bounded Capacities (2003)
F. Barbanera, M. Bugliesi, M. Dezani-ciancaglini, V. Sassone
Abstract. 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...
A Calculus of Bounded Capacities (2003)
F. Barbanera, M. Bugliesi, M. Dezani-ciancaglini, V. Sassone
Abstract. 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...
A Calculus of Bounded Capacities (2003)
F. Barbanera, M. Bugliesi, M. Dezani-ciancaglini, V. Sassone
Abstract. 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...
A Calculus of Bounded Capacities (2003)
F. Barbanera, M. Bugliesi, M. Dezani-ciancaglini, V. Sassone
Abstract. 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...
A Calculus of Bounded Capacities (2003)
F. Barbanera, M. Bugliesi, V. Sassone
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...
A Calculus of Bounded Capacities (2003)
F. Barbanera, M. Bugliesi, M. Dezani-ciancaglini, V. Sassone
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...
M. Hennessy, T. Owen, J. Rathke, V. Sassone, I. Wakeman, D. Watson
We propose an integrated approach to resource management for end-to-end pervasive services, spanning over foundational models, abstract machines, runtime environments and programming languages. Our...
Typing and Subtyping Mobility in Boxed Ambients (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...
A Calculus of Mobile Resources (2002)
Godskesen, J.Chr., Hildebrandt, T., Sassone, V.
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,...
Jeeg: A Programming Language for Concurrent Objects Synchronization (2002)
We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the `business' and the `synchronization'...
Deriving Bisimulation Congruences: A 2-Categorical Approach (2002)
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...
Communication Interference in Mobile Boxed Ambients (2002)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.
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...
Communication Interference in Mobile Boxed Ambients (talk) (2002)
Talk given at FST&TCS 2002
Capacity-Bounded Computational Ambients (talk) (2002)
Talk give at FOSAD 2002, Bertinoro 25.09.02
Typing and Subtyping Mobility in Boxed Ambients (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...
A Calculus of Mobile Resources (2002)
Godskesen, J.Chr., Hildebrandt, T., Sassone, V.
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,...
Jeeg: A Programming Language for Concurrent Objects Synchronization (2002)
We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the `business' and the `synchronization'...
Deriving Bisimulation Congruences: A 2-Categorical Approach (2002)
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...
Communication Interference in Mobile Boxed Ambients (2002)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.
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...
Communication Interference in Mobile Boxed Ambients (talk) (2002)
Talk given at FST&TCS 2002
Capacity-Bounded Computational Ambients (talk) (2002)
Talk give at FOSAD 2002, Bertinoro 25.09.02
Typing and Subtyping Mobility in Boxed Ambients (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...
A Calculus of Mobile Resources (2002)
Godskesen, J.Chr., Hildebrandt, T., Sassone, V.
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,...
Jeeg: A Programming Language for Concurrent Objects Synchronization (2002)
We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the `business' and the `synchronization'...
Deriving Bisimulation Congruences: A 2-Categorical Approach (2002)
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...
Communication Interference in Mobile Boxed Ambients (2002)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.
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...
Communication Interference in Mobile Boxed Ambients (talk) (2002)
Talk given at FST&TCS 2002
Capacity-Bounded Computational Ambients (talk) (2002)
Talk give at FOSAD 2002, Bertinoro 25.09.02
Two Algebraic Process Semantics for Contextual Nets (2001)
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...
Functorial Semantics for Petri Nets (2001)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
High-Level Petri Nets as Type Theories in the Join Calculus (2001)
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...
Towards a Notion of Distributed Time for Petri Nets (2001)
Nielsen, M., Sassone, V., Srba, J.
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...
Properties of Distributed Time Arc Petri Nets (2001)
Nielsen, M., Sassone, V., Srba, J.
In recent work 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...
A Type Inference Algorithm for Secure Ambients (2001)
Barbanera, F., Dezani, M., Salvo, I., Sassone, V.
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We...
An introduction to the π-calculus - Model, Variations, Semantics (talk) (2001)
Course given at Sussex Summer 2001
Two Algebraic Process Semantics for Contextual Nets (2001)
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...
Functorial Semantics for Petri Nets (2001)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
High-Level Petri Nets as Type Theories in the Join Calculus (2001)
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...
Towards a Notion of Distributed Time for Petri Nets (2001)
Nielsen, M., Sassone, V., Srba, J.
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...
Properties of Distributed Time Arc Petri Nets (2001)
Nielsen, M., Sassone, V., Srba, J.
In recent work 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...
A Type Inference Algorithm for Secure Ambients (2001)
Barbanera, F., Dezani, M., Salvo, I., Sassone, V.
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We...
An introduction to the π-calculus - Model, Variations, Semantics (talk) (2001)
Course given at Sussex Summer 2001
Two Algebraic Process Semantics for Contextual Nets (2001)
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...
Functorial Semantics for Petri Nets (2001)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
High-Level Petri Nets as Type Theories in the Join Calculus (2001)
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...
Towards a Notion of Distributed Time for Petri Nets (2001)
Nielsen, M., Sassone, V., Srba, J.
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...
Properties of Distributed Time Arc Petri Nets (2001)
Nielsen, M., Sassone, V., Srba, J.
In recent work 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...
A Type Inference Algorithm for Secure Ambients (2001)
Barbanera, F., Dezani, M., Salvo, I., Sassone, V.
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We...
An introduction to the π-calculus - Model, Variations, Semantics (talk) (2001)
Course given at Sussex Summer 2001
Functorial Models for Petri Nets (2001)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
Functorial Models for Petri Nets (2001)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
On the Algebraic Structure of Petri Nets (2000)
This paper retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the...
Algebraic Models for Contextual Nets (2000)
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...
Open Ended Systems, Dynamic Bisimulation, and Tile Logic (2000)
Bruni, R., Montanari, U., Sassone, V.
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest...
On the Algebraic Structure of Petri Nets (2000)
This paper retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the...
Algebraic Models for Contextual Nets (2000)
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...
Open Ended Systems, Dynamic Bisimulation, and Tile Logic (2000)
Bruni, R., Montanari, U., Sassone, V.
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest...
On the Algebraic Structure of Petri Nets (2000)
This paper retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the...
Algebraic Models for Contextual Nets (2000)
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...
Open Ended Systems, Dynamic Bisimulation, and Tile Logic (2000)
Bruni, R., Montanari, U., Sassone, V.
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest...
Functorial Semantics for Petri Nets under the Individual Token Philosophy (1999)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the...
Functorial Semantics for Petri Nets under the Individual Token Philosophy (1999)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the...
Functorial Semantics for Petri Nets under the Individual Token Philosophy (1999)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the...
Functorial Semantics for Petri Nets under the Individual Token Philosophy (1999)
R. Bruni, J. Meseguer, U. Montanari, V. Sassone
Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the...
An Axiomatization of the Category of Petri Net Computations (1998)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes which can be expressed axiomatically via a functor Qn(_) from the category of Petri nets to an...
Petri Nets and Other Models of Concurrency (1998)
This paper retraces, collects, and summarises contributions of the authors --- in collaboration with others --- on the theme of Petri nets and their categorical relationships to other models of...
A Comparison of Petri Net Semantics under the Collective Token Philosophy (1998)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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 Axiomatization of the Category of Petri Net Computations (1998)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes which can be expressed axiomatically via a functor Qn(_) from the category of Petri nets to an...
Petri Nets and Other Models of Concurrency (1998)
This paper retraces, collects, and summarises contributions of the authors --- in collaboration with others --- on the theme of Petri nets and their categorical relationships to other models of...
A Comparison of Petri Net Semantics under the Collective Token Philosophy (1998)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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 Axiomatization of the Category of Petri Net Computations (1998)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes which can be expressed axiomatically via a functor Qn(_) from the category of Petri nets to an...
Petri Nets and Other Models of Concurrency (1998)
This paper retraces, collects, and summarises contributions of the authors --- in collaboration with others --- on the theme of Petri nets and their categorical relationships to other models of...
A Comparison of Petri Net Semantics under the Collective Token Philosophy (1998)
Bruni, R., Meseguer, J., Montanari, U., Sassone, V.
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...
On the Semantics of Place/Transition Petri Nets (1997)
Meseguer, J., Montanari, U., Sassone, V.
Place/Transition (PT) Petri 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 too...
Transition Systems with Independence and Multi-Arcs (1997)
We extend the model of transition systems with independence in order to provide it with a feature relevant in the noninterleaving analysis of concurrent systems, namely multi-arcs. Moreover, we study...
Representation Theorems for Petri Nets (1997)
Meseguer, J., Montanari, U., Sassone, V.
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...
On the Semantics of Place/Transition Petri Nets (1997)
Meseguer, J., Montanari, U., Sassone, V.
Place/Transition (PT) Petri 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 too...
Transition Systems with Independence and Multi-Arcs (1997)
We extend the model of transition systems with independence in order to provide it with a feature relevant in the noninterleaving analysis of concurrent systems, namely multi-arcs. Moreover, we study...
Representation Theorems for Petri Nets (1997)
Meseguer, J., Montanari, U., Sassone, V.
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...
On the Semantics of Place/Transition Petri Nets (1997)
Meseguer, J., Montanari, U., Sassone, V.
Place/Transition (PT) Petri 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 too...
Transition Systems with Independence and Multi-Arcs (1997)
We extend the model of transition systems with independence in order to provide it with a feature relevant in the noninterleaving analysis of concurrent systems, namely multi-arcs. Moreover, we study...
Representation Theorems for Petri Nets (1997)
Meseguer, J., Montanari, U., Sassone, V.
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...
Process versus Unfolding Semantics for Place/Transition Petri Nets (1996)
Meseguer, J., Montanari, U., Sassone, V.
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...
Models for Concurrency: Towards a Classification (1996)
Sassone, V., Nielsen, M., Winskel, G.
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...
An Axiomatization of the Algebra of Petri Net Concatenable Processes (1996)
The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $Pn(N)$. However, this is only a partial axiomatization, since it is based...
Higher Dimensional Transition Systems (1996)
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition. We show...
Comparing Transition Systems with Independence and Asynchronous Transition Systems (1996)
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...
Process versus Unfolding Semantics for Place/Transition Petri Nets (1996)
Meseguer, J., Montanari, U., Sassone, V.
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...
Models for Concurrency: Towards a Classification (1996)
Sassone, V., Nielsen, M., Winskel, G.
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...
An Axiomatization of the Algebra of Petri Net Concatenable Processes (1996)
The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $Pn(N)$. However, this is only a partial axiomatization, since it is based...
Higher Dimensional Transition Systems (1996)
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition. We show...
Comparing Transition Systems with Independence and Asynchronous Transition Systems (1996)
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...
Process versus Unfolding Semantics for Place/Transition Petri Nets (1996)
Meseguer, J., Montanari, U., Sassone, V.
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...
Models for Concurrency: Towards a Classification (1996)
Sassone, V., Nielsen, M., Winskel, G.
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...
An Axiomatization of the Algebra of Petri Net Concatenable Processes (1996)
The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $Pn(N)$. However, this is only a partial axiomatization, since it is based...
Higher Dimensional Transition Systems (1996)
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition. We show...
Comparing Transition Systems with Independence and Asynchronous Transition Systems (1996)
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...
On the Category of Petri Net Computations (1995)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [DMM89] which can be expressed axiomatically via a functor $Q[-]$ from the category of Petri nets to...
Axiomatizing Petri Net Concatenable Processes (1995)
The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $P[N]$. Yet, this is only a partial axiomatization, since $P[N]$ is built...
Characterizing Behavioural Congruences for Petri Nets (1995)
Nielsen, M., Priese, L., Sassone, V.
We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of...
On the Category of Petri Net Computations (1995)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [DMM89] which can be expressed axiomatically via a functor $Q[-]$ from the category of Petri nets to...
Axiomatizing Petri Net Concatenable Processes (1995)
The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $P[N]$. Yet, this is only a partial axiomatization, since $P[N]$ is built...
Characterizing Behavioural Congruences for Petri Nets (1995)
Nielsen, M., Priese, L., Sassone, V.
We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of...
On the Category of Petri Net Computations (1995)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [DMM89] which can be expressed axiomatically via a functor $Q[-]$ from the category of Petri nets to...
Axiomatizing Petri Net Concatenable Processes (1995)
The concatenable processes of a Petri net $N$ can be characterized abstractly as the arrows of a symmetric monoidal category $P[N]$. Yet, this is only a partial axiomatization, since $P[N]$ is built...
Characterizing Behavioural Congruences for Petri Nets (1995)
Nielsen, M., Priese, L., Sassone, V.
We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of...
Relationships between Models for Concurrency (1994)
Nielsen, M., Sassone, V., Winskel, G.
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...
On the Model of Computation of Place/Transition Petri Nets (1994)
Meseguer, J., Montanari, U., Sassone, V.
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...
An Approach to the Category of Net Computations (1994)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [DMM89] which can be expressed axiomatically via a functor $Q[-]$ from the category of Petri nets to...
Relationships between Models for Concurrency (1994)
Nielsen, M., Sassone, V., Winskel, G.
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...
On the Model of Computation of Place/Transition Petri Nets (1994)
Meseguer, J., Montanari, U., Sassone, V.
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...
An Approach to the Category of Net Computations (1994)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [DMM89] which can be expressed axiomatically via a functor $Q[-]$ from the category of Petri nets to...
Relationships between Models for Concurrency (1994)
Nielsen, M., Sassone, V., Winskel, G.
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...
On the Model of Computation of Place/Transition Petri Nets (1994)
Meseguer, J., Montanari, U., Sassone, V.
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...
An Approach to the Category of Net Computations (1994)
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [DMM89] which can be expressed axiomatically via a functor $Q[-]$ from the category of Petri nets to...
ω-Ind Completion of Monoidal Categories and Infinite Petri Net Computations. (1993)
Meseguer, J., Montanari, U., Sassone, V.
There exists a KZ-doctrine on the 2-category of the locally small categories whose algebras are exactly the categories which admits all the colimits indexed by $\omega$-chains. The paper presents a...
A Unification Free Introduction to Logic Programming (1993)
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programming, which differs from classical introductions in at least two ways: the use of predicate algebras...
A Note on Logic Programming Fixed-Point Semantics (1993)
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is characterized by...
A Classification of Models for Concurrency (1993)
Sassone, V., Nielsen, M., Winskel, G.
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...
Deterministic Behavioural Models for Concurrency (1993)
Sassone, V., Nielsen, M., Winskel, G.
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in...
ω-Ind Completion of Monoidal Categories and Infinite Petri Net Computations. (1993)
Meseguer, J., Montanari, U., Sassone, V.
There exists a KZ-doctrine on the 2-category of the locally small categories whose algebras are exactly the categories which admits all the colimits indexed by $\omega$-chains. The paper presents a...
A Unification Free Introduction to Logic Programming (1993)
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programming, which differs from classical introductions in at least two ways: the use of predicate algebras...
A Note on Logic Programming Fixed-Point Semantics (1993)
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is characterized by...
A Classification of Models for Concurrency (1993)
Sassone, V., Nielsen, M., Winskel, G.
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...
Deterministic Behavioural Models for Concurrency (1993)
Sassone, V., Nielsen, M., Winskel, G.
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in...
ω-Ind Completion of Monoidal Categories and Infinite Petri Net Computations. (1993)
Meseguer, J., Montanari, U., Sassone, V.
There exists a KZ-doctrine on the 2-category of the locally small categories whose algebras are exactly the categories which admits all the colimits indexed by $\omega$-chains. The paper presents a...
A Unification Free Introduction to Logic Programming (1993)
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programming, which differs from classical introductions in at least two ways: the use of predicate algebras...
A Note on Logic Programming Fixed-Point Semantics (1993)
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is characterized by...
A Classification of Models for Concurrency (1993)
Sassone, V., Nielsen, M., Winskel, G.
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice...
Deterministic Behavioural Models for Concurrency (1993)
Sassone, V., Nielsen, M., Winskel, G.
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in...
Dynamic Congruence vs. Progressing Bisimulation for CCS (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....
On the Semantics of Petri Nets (1992)
Meseguer, J., Montanari, U., Sassone, V.
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 too...
Dynamic Congruence vs. Progressing Bisimulation for CCS (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....
On the Semantics of Petri Nets (1992)
Meseguer, J., Montanari, U., Sassone, V.
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 too...
Dynamic Congruence vs. Progressing Bisimulation for CCS (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....
On the Semantics of Petri Nets (1992)
Meseguer, J., Montanari, U., Sassone, V.
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 too...
A unifying Petri net model of non-interference and non-deducibility information flow security (1991)
In this paper we introduce FIFO Information Flow Nets (FIFN) as a model for describing information flow security properties. The FIFN is based on Petri nets and has been derived from the work...
A unifying Petri net model of non-interference and non-deducibility information flow security (1991)
In this paper we introduce FIFO Information Flow Nets (FIFN) as a model for describing information flow security properties. The FIFN is based on Petri nets and has been derived from the work...
A unifying Petri net model of non-interference and non-deducibility information flow security (1991)
In this paper we introduce FIFO Information Flow Nets (FIFN) as a model for describing information flow security properties. The FIFN is based on Petri nets and has been derived from the work...
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.\...
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.\...
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.\...