Lecture

Building Safety Critical Systems

Graph Chat

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.

Description

This lecture discusses the importance of integrating efficiency considerations into the design process of safety critical systems, focusing on correctness and efficiency. It explores the challenges faced in achieving both correctness and efficiency, the role of certification authorities, the development of new design techniques, and the move towards integrated computing environments. The lecture delves into topics such as real-time computing, model-based design techniques, synchronous reactive programming, worst case execution time analysis, mixed criticality scheduling, and cyclic executives. It also addresses the social aspect of achieving certification, the need for graceful degradation in systems, and the complexities of certification processes. The instructor emphasizes the need to balance correctness, efficiency, and development costs in building safety critical systems.

Official source

Related concepts (10)

Certificate authority

In cryptography, a certificate authority or certification authority (CA) is an entity that stores, signs, and issues digital certificates. A digital certificate certifies the ownership of a public key by the named subject of the certificate. This allows others (relying parties) to rely upon signatures or on assertions made about the private key that corresponds to the certified public key. A CA acts as a trusted third party—trusted both by the subject (owner) of the certificate and by the party relying upon the certificate.

Public key certificate

In cryptography, a public key certificate, also known as a digital certificate or identity certificate, is an electronic document used to prove the validity of a public key. The certificate includes information about the key, information about the identity of its owner (called the subject), and the digital signature of an entity that has verified the certificate's contents (called the issuer). If the signature is valid, and the software examining the certificate trusts the issuer, then it can use that key to communicate securely with the certificate's subject.

Root certificate

In cryptography and computer security, a root certificate is a public key certificate that identifies a root certificate authority (CA). Root certificates are self-signed (and it is possible for a certificate to have multiple trust paths, say if the certificate was issued by a root that was cross-signed) and form the basis of an X.509-based public key infrastructure (PKI). Either it has matched Authority Key Identifier with Subject Key Identifier, in some cases there is no Authority Key identifier, then Issuer string should match with Subject string ().

Certificate revocation list

In cryptography, a certificate revocation list (or CRL) is "a list of digital certificates that have been revoked by the issuing certificate authority (CA) before their scheduled expiration date and should no longer be trusted". CRLs are no longer required by the CA/Browser forum, as alternate certificate revocation technologies (such as OCSP) are increasingly used instead. Nevertheless, CRLs are still widely used by the CAs.

Real-time computing

Real-time computing (RTC) is the computer science term for hardware and software systems subject to a "real-time constraint", for example from event to system response. Real-time programs must guarantee response within specified time constraints, often referred to as "deadlines". Real-time responses are often understood to be in the order of milliseconds, and sometimes microseconds. A system not specified as operating in real time cannot usually guarantee a response within any timeframe, although typical or expected response times may be given.

Related lectures (20)

Farkas' Lemma: Applications in Game Theory

Explores Farkas' Lemma, hyperplane separation, combinatorics, and its application in game theory, focusing on penalty kick strategies.

Efficient Safety-Critical Systems

Delves into building efficient safety-critical systems, emphasizing the importance of worst-case execution times and the challenges of integrating efficiency considerations into design processes.

SSL Certificates: Understanding and Python Implementation

Delves into SSL certificates, Python implementation, and root certificate chains.