Publication

Improving Confidence in Service Implementation in an Intelligent Network

Related publications (25)

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.

Exact Synthesis of LTL Properties from Traces

Heinz Riener

We present an exact approach to synthesize temporal-logic formulas in linear temporal logic (LTL) from a set of given positive and negative example traces. Our approach uses topology structures, in particular partial DAGs, to partition the search space int ...

IEEE2019

From Uncertainty Data to Robust Policies for Temporal Logic Planning

Maryam Kamgarpour, Tony Alan Wood

We consider the problem of synthesizing robust disturbance feedback policies for systems performing complex tasks. We formulate the tasks as linear temporal logic specifications and encode them into an optimization framework via mixed-integer constraints. ...

ACM2018

Position Accuracy with Redundant MEMS IMU for Road Applications

Jan Skaloud, Pierre-Yves Gilliéron, Bertrand Merminod, Philipp Clausen

The diversity of road applications and intelligent transportation systems (ITS) makes the definition of positioning integrity a real challenge because the requirements are changing from one application to another. Even within liability or safety critical a ...

2015

Applying model checking to industrial-sized PLC programs

Jean-Charles Tournier, Simon Bliudze, Borja Fernandez Adiego

Programmable Logic Controllers (PLCs) are embedded computers widely used in industrial control systems. Ensuring that a PLC software complies with its specification is a challenging task. Formal verification has become a recommended practice to ensure the ...

Institute of Electrical and Electronics Engineers2015

Automated refactoring for size reduction of CSS style sheets

Martí Bosch Padrós

Cascading Style Sheets (CSS) is a standard language for stylizing and formatting web documents. Its role in web user experience becomes increasingly important. However, CSS files tend to be designed from a result-driven point of view, without much attentio ...

2014

Contracts for Real-Time, Safety Critical Systems

Chandrakana Nandi

Verifying real-time systems goes beyond the verification of functional properties: it also requires the checking of real-time properties. This makes traditional contract-frameworks partially inept for checking real-time programs. This is a major problem be ...

2014

Automatic Verification of Temporal Epistemic Logic under Convergent Equational Theories

We present a methodology for the automatic veriﬁcation of multi-agent systems against temporal-epistemic speciﬁcations derived from higher-level languages deﬁned over convergent equational theories. We introduce a modality called rewriting knowledge that o ...

2012

Model checking: Algorithmic verification and debugging

Joseph Sifakis

Turing Lecture from the winners of the 2007 ACM A.M. Turing Award.In 1981, Edmund M. Clarke and E. Allen Emerson, working in the USA, and Joseph Sifakis working independently in France, authored seminal papers that founded what has become the highly succes ...

2009

Emotion on FPGA: Model Driven Approach

Arash Arami

Implementation of intelligent and bio-inspired algorithms in industrial and real applications is arduous, time consuming and costly; in addition, many aspects of system from high level behavior of algorithm to energy consumption of targeted system must be ...

Elsevier2009

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

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