Automata theory

Related publications (235)

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.

Atomic Probabilistic Broadcast

Patrick Eugster

Many applications, such as the dissemination of stock quote events, require reliable and totally ordered delivery of broadcast messages to a large number of processes. Recently, gossip-based broadcast algorithms have been praised as an interesting alternat ...

2003

Finite element method analysis of the coupling effect between superconducting filaments of different aspect ratio

Francesco Grilli, Yong Yang, Bertrand Dutoit

Using 3D finite element method (FEM) modelling, the present work investigates the coupling effect between two finite superconductors through a resistive matrix. This effect, related to the finite length of the conductors, is typically three-dimensional and ...

2003

Mining Specifications

James Richard Larus

Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally describe correct behavior or errors is a major barrier to the widespread ado ...

ACM2002

Probabilistic Queries in Large-Scale Networks

Fernando Pedone

Resource location is a fundamental problem for large-scale distributed applications. This paper discusses the problem from a probabilistic perspective. Contrary to deterministic approaches, which strive to produce a precise outcome, probabilistic approache ...

2002

Democratizing the Parliament

Rachid Guerraoui

This paper presents a replication algorithm that implements a highly-available, non deterministic state machine. ...

2001

Democratrizing the Parliament

Rachid Guerraoui

This paper presents a replication algorithm that implements a highly-available, non-deterministic state machine. Our algorithm generalizes the Paxos parliament algorithm of Lamport to cope with non-deterministic computations, while preserving its nice resi ...

2001

From RM-ODP to the Formal Behavior Representation

Alain Wegmann, Pavel Balabko

In this work we consider the behavioral aspects of system modeling. In order to specify the behavior of a system, many different notations can be used. Quite often different terms in these notations are related with to same element in a system implementati ...

2001

Sudden drawdown and drainage of a horizontal aquifer

David Andrew Barry, Marc Parlange

Drainage of a saturated horizontal aquifer following a sudden drawdown is reanalyzed using the Boussinesq equation. The effect of the finite length of the aquifer is considered in detail. An analytical approximation based on a superposition principle yield ...

2001

Dynamic load balancing of parallel cellular automata

Roger Hersch, Marc Mazzariol

We are interested in running in parallel cellular automata. We present an algorithm which explores the dynamic remapping of cells in order to balance the load between processing nodes. The parallel application runs on a cluster of PCs connected by Fast-Eth ...

SPIE-Int. Soc. Opt. Eng2000

Moving Horizon Estimation for Piecewise Affine Systems

Giancarlo Ferrari Trecate

Many practical control, estimation and fault detection problems involve hybrid systems, here losely defined as systems involving both continuous and discrete variables. Various approaches have been proposed for modeling hybrid systems. Often engineering sy ...

2000