Concept

Hypothèse du monde clos

Publications associées (17)

Imagine the Unseen World: A Benchmark for Systematic Generalization in Visual World Models

Systematic compositionality, or the ability to adapt to novel situations by creating a mental model of the world using reusable pieces of knowledge, remains a significant challenge in machine learning. While there has been considerable progress in the lang ...

2023

When is it safe to run a transactional workload under Read Committed?

Christoph Koch, Bas Ketsman

The popular isolation level multiversion Read Committed (RC) exchanges some of the strong guarantees of serializability for increased transaction throughput. Nevertheless, transaction workloads can sometimes be executed under RC while still guaranteeing se ...

ASSOC COMPUTING MACHINERY2023

Emergence of diauxie as an optimal growth strategy under resource allocation constraints in cellular metabolism

Vassily Hatzimanikatis, Pierre Guy Rémy Salvy

Diauxie, or the sequential consumption of carbohydrates in bacteria such as Escherichia coli, has been hypothesized to be an evolutionary strategy which allows the organism to maximize its instantaneous specific growth-giving the bacterium a competitive ad ...

NATL ACAD SCIENCES2021

Architecture Internalisation in BIP

Joseph Sifakis, Simon Bliudze

We consider two approaches for building component-based systems, which we call respectively architecture-based and architecture-agnostic. The former consists in describing coordination constraints in a purely declarative manner through parameterizable glue ...

ACM2014

Architecture Internalisation in BIP

Joseph Sifakis, Simon Bliudze

Architectures allow shifting the focus of developers from low-level code to high-level structures ensuring coordination in component-based systems. If the architecture description language is expressive enough, it is possible to describe architectures in a ...

2014

Traduction des opérations de l'analyse historique dans le langage conceptuel des systèmes d'information géographique pour une exploration des processus morphologiques de la ville et du territoire

Eduardo Camacho-Hübner

Present work intends to conceive an interface between Urban Morphology and Geographic Information Science (GISc). This interface is considered as a space of exchange for knowledge exploration between several disciplines. The links pointed out from this the ...

EPFL2009

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009

Semantics of OCL specified with QVT

Slavisa Markovic

The Object Constraint Language (OCL) has been for many years formalized both in its syntax and semantics in the language standard. While the official definition of OCL's syntax is already widely accepted and strictly supported by most OCL tools, there is n ...

Springer-Verlag2008

An Example of a Hierarchical System Model Using SEAM and its Formalization in Alloy

Gil Regev, Alain Wegmann, Lam Son Lê, Irina Rychkova, José Diego de la Cruz Garcia

SEAM is an enterprise architecture method based on RM-ODP part 2. In this paper, we present an example of a SEAM hierarchical model where the behavioral part is formalized in Alloy. We introduce four kinds of actions and their relationships to properties t ...

2007

From Liveness to Promptness

Liveness temporal properties state that something

good'' eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the

wait time'' for an eventually to be fulfilled. That is,

F\theta

...

2007

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

From Liveness to Promptness

Liveness temporal properties state that something

good'' eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the

wait time'' for an eventually to be fulfilled. That is,

F\theta

...

2007

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009