There exist situations in which the communication via public channels should not reveal the identity of the participants. We define a process calculus able to control such a communication by using a specific synchronization operator working over a given ...

The paper shows that some usual specifications cannot be conveniently expressed in traditional process calculi. To solve the problem in formal specification, a new process calculus based on value-passing CCS, Calculus of Communicating Systems with ...

We propose a fully abstract semantics for value-passing CCS for trees (VCCTS) with the feature that processes are located at the vertices of a graph whose edges describe possible interaction capabilities. The operational semantics is given both in terms ...

The universal composability (UC) framework is the established standard for analyzing cryptographic protocols in a modular way, such that security is preserved under concurrent composition with arbitrary other protocols. However, although UC is widely ...

WSN-based CPS can be used to collect information from remote environment and control it. Delay and dependability directly affect the running quality of WSN-based CPS. In this paper, we present a specified process calculus to model the running of the ...

Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus. Remarkably, machine-checked proofs of standard algebraic and ...

This paper proposes a theoretical foundation for specifying and reasoning about adaptations based on our middleware system that introduces the relocation of software components to define functions between computers as a basic mechanism for adaptation on ...

The article tackles the problem of conformance checking of communicating resource systems, such as hierarchical distributed systems, Restful Web services, ROA systems, etc. We present a framework, consisting of methods and algorithms, which allows to ...

A peer-to-peer (p2p) system provides the networking substrate for the execution of distributed applications. It is made of peers that interact over an overlay network. Overlay networks are highly dynamic, as peers can join and leave at any time. ...

Bisimilarity of two processes is formally established by producing a bisimulation relation that contains those two processes and obeys certain closure properties. In many situations, particularly when the underlying labeled transition system is ...

In this paper, we present a normal bisimulation for higher order pi-calculus with unguarded choice and prove the coincidence between such normal bisimulation and context bisimulation for higher order pi-calculus with unguarded choice. To achieve this ...

DNA nanotechnology is a rapidly-growing field, with many potential applications in nanoscale manufacturing and autonomous in vivo diagnostic and therapeutic devices. As experimental techniques improve it will become increasingly important to develop ...

Distributed verification uses the resources of several computers to speed up the verification and, even more importantly, to access large amounts of memory beyond the capabilities of a single computer. In this paper, we describe the distributed ...

We present an LTS-based (Labelled Transition System) CSP-like (Communicating Sequential Processes) formalism for expressing parametrised systems. The parameters are process types, which determine the number of replicated components, and data types, ...

In this paper, we present a normal bisimulation for higher order p-calculus with unguarded choice and prove the coincidence between such normal bisimulation and context bisimulation for higher order p-calculus with unguarded choice. To achieve this aim, ...

In this paper, we propose a process calculus, Context-aware System Calculus (CSC), in order to describe context-aware systems that can maintain context models and carry out some operations, including requesting context-aware services, according to the ...

The fusion calculi are a simplification of the pi-calculus in which input and output are symmetric and restriction is the only binder. We highlight a major difference between these calculi and the pi-calculus from the point of view of types, proving ...

In this paper we present a new framework for automatically proving the security of public-key cryptographic schemes in computational model. The framework uses the sequence-of-games approach to construct security proof. A probabilistic polynomial-time ...

This paper develops a truly concurrent semantical approach, whereby concurrency is notionally independent of nondeterminism, that allows describing the deterministically concurrent behaviour of recursive processes accessing consumable resources. The ...