Concept

Minimisation d'un automate fini déterministe

Publications associées (34)

WHO'S ON BOARD? Probabilistic Membership for Real-Time Distributed Control Systems

To increase their dependability, distributed control systems (DCSs) need to agree in real time about crashed hosts, i.e., they need a real-time membership service. In this paper, we prove that such a service cannot be implemented deterministically if, besi ...

Ieee2016

Algebraic Cryptanalysis of Deterministic Symmetric Encryption

Petr Susil

Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and ...

EPFL2015

Probabilistic speed-density relationship for pedestrian traffic: a data-driven approach

Michel Bierlaire, Bilal Farooq, Marija Nikolic

We propose a probabilistic modeling approach to represent the speed-density relationship of pedestrian traffic. The approach is data-driven, and it is motivated by the presence of high scatter in the raw data that we have analyzed. We show the validity of ...

2015

Finite state encoders and decoders for vector signaling codes

Mohammad Amin Shokrollahi, Harm Cronie

In a chip-to-chip communication system and apparatus, a set of physical signals to be conveyed over a communication bus is provided, and mapped to a codeword of a vector signaling code using the physical signals and a state information, wherein a codeword ...

2014

Formation of drying crack patterns in soils : a deterministic approach

Lyesse Laloui, Hervé Péron

Soils, as well as most of deformable multiphase porous materials, are likely to suffer from desiccation cracking, leading to the formation of regular crack patterns affecting their permeability. The ensuing cracks spacing has often been related to a concep ...

Springer Verlag2013

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...

IEEE2012

Broadcasting Nested Message Sets

Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In this paper, we take a deterministic approach to the problem of broadcasting nested message sets. We mainly consider the scenario where a common message and a private message are to be encoded into a signal and transmitted over a broadcast channel toward ...

2012

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010

Dynamic analysis of anchored concrete linings of plunge pools loaded by high velocity jet impacts issuing from dam spillways

Anton Schleiss

A theoretical stochastic approach is presented for the structural analysis of plunge pool liners dynamically loaded by the impact of free-falling jets. Such an approach was used as the real behaviour of plunge pool liners is complex, and deterministic meth ...

2010

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010