Concept

Calculus of communicating systems

Related publications (15)

Orchestrating learning analytics (OrLA): Supporting inter-stakeholder communication about adoption of learning analytics at the classroom level

Despite the recent surge of interest in learning analytics (LA), their adoption in everyday classroom practice is still slow. Knowledge gaps and lack of inter-stakeholder communication (particularly with educational practitioners) have been posited as crit ...

2019

Jacket for embodied interaction with virtual or distal robotic device

David Atienza Alonso, Dario Floreano, Stefano Mintchev, Fabio Isidoro Tiberio Dell'Agnola, Carine Rognon, Alice Ghislaine Concordel

A system for interacting with a remote object comprising a wearable jacket for a user, two actuators for supporting arms of the user, motors for causing movements to at least one of a torso and the arms of the user, and sensors for measuring at least one o ...

2018

Uniform Analysis for Communicating Timed Systems (Extended Technical Report)

Hossein Hojjat

Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in an industrial and academic context. Model checking for timed automata has been studied extensively ...

2013

Towards Complete Reasoning about Axiomatic Specifications

Viktor Kuncak, Swen Jacobs

To support verification of expressive properties of functional programs, we consider algebraic style specifications that may relate multiple user-defined functions, and compare multiple invocations of a function for different arguments. We present decision ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Equivalences and calculi for formal verification of cryptographic protocols

Johannes Borgström

Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptograp ...

EPFL2008

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008

Theory and tool support for the formal verification of cryptographic protocols

Sébastien Briais

Cryptographic protocols are an essential component of network communications. Despite their relatively small size compared to other distributed algorithms, they are known to be error-prone. This is due to the obligation to behave robustly in the context of ...

EPFL2008

Do Nash values have value?

Bettina Schaefli

How Do We Communicate Model Performance? The process of model performance evaluation is of primary importance, not only in the model development and calibration process, but also when communicating the results to other researchers and to stakeholders. The ...

Wiley-Blackwell2007

Protocol composition frameworks and modular group communication

Sergio Mena

It is noticeable that our society is increasingly relying on computer systems. Nowadays, computer networks can be found at places where it would have been unthinkable a few decades ago, supporting in some cases critical applications on which human lives ma ...

EPFL2006

Concurrency Combinators for Declarative Synchronization

Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronization is required. A synchronization logic, or policy, is at present entangled i ...

Springer2004

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008