DI GIUSTO , Cinzia

Communication-centric systems are software systems built as assemblies of distributed arti-facts that interact following predefined communication protocols. Session-based concurrency is a type-based approach to ensure the conformance of communication-centric systems to such protocols. This paper presents a model of session-based concurrency...

International audience

This paper presents a model of session-based concurrency with constructs for runtime adaptation. Our model allows for the dynamic update of the behavior of communication-centric systems. We propose an event-based approach: adaptation requests, issued by the system or its environment, are assimilated to events which may trigger runtime...

International audience

In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases. We show two results (both for mailbox and peer-to-peer automata): first, the reachability problem is decidable for...

A communicating system is k-synchronizable if all of the message sequence charts representing the executions can be divided into slices of [Formula: see text] sends followed by k receptions. It was previously shown that, for a fixed given k, one could decide whether a communicating system is k-synchronizable. This result is interesting because...

International audience

We study k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases. We show two results (both for mailbox and peer-to-peer automata): first, the reachability problem is decidable for k-synchronizable systems; second,...

International audience

International audience

International audience

International audience

In this paper we present a novel approach to model Spiking Neural Networks. These networks, referred as third generation ones, add a new dimension to the second generation: the temporal axis. We propose a formalisation of Spiking Neural Networks based on Timed Automata Networks. Neurons are modelled as timed automata waiting for inputs on a...

International audience

In this paper we present a novel approach to automatically infer parameters of spiking neural networks. Neurons are modelled as timed automata waiting for inputs on a number of different channels (synap-ses), for a given amount of time (the accumulation period). When this period is over, the current potential value is computed considering...

Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate through phases in which messages are first sent and then received, for each process. Such systems enjoy a limited form of synchronization, and for some communication...

In this paper we consider discrete qualitative models of ecosystems viewed as collections of interacting living (animals, plants.. .) and nonliving entities (air, water, soil.. .), whose conditions of appearance/disappearance are controlled by a set of formal rules (i.e., processes). We present here a rule-based method allowing to compare...

There is a wide variety of message-passing communication models, ranging from synchronous "rendez-vous" communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the communication model is determined by the transport layer of the network, and a few classes of orders of message delivery (FIFO,...

We study the complexity relationship between three models of unbounded memory automata: nu-automata (ν-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory over infinite alphabets. We prove that the membership problem is NP-complete for all of them, while...

We study the complexity relationship between three models of unbounded memory automata: nu-automata (ν-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory over infinite alphabets. We prove that the membership problem is NP-complete for all of them, while...

Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate through phases in which messages are first sent and then received, for each process. Such systems enjoy a limited form of synchronization, and for some communication...

There is a wide variety of message-passing communication models, ranging from synchronous "rendez-vous" communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the communication model is determined by the transport layer of the network, and a few classes of orders of message delivery (FIFO,...

Ensuring that communication-centric systems interact according to an intended protocol is an important but difficult problem, particularly for systems with some reactive or timed components. To rise to this challenge, we study the integration of session-based concurrency and Synchronous Reactive Programming (SRP). We propose a process calculus...

We consider discrete qualitative models of ecosystems viewed as collections of interacting living (animals, plants..) and nonliving entities (air, water, soil..), whose conditions of appearance/disappearance are controlled by a set of formal rules (i.e., processes). We present here two methods to statically analyze models. The first one is used...

Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate through phases in which messages are first sent and then received, for each process. Such systems enjoy a limited form of synchronization, and for some communication...