Lecture

LabVIEW Design Patterns

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.

In course

ME-213: Programmation pour ingénieur

Mettre en pratique les bases de la programmation vues au semestre précédent. Développer un logiciel structuré. Méthode de debug d'un logiciel. Introduction à la programmation scientifique. Introduction à l'instrumentation virtuelle. ...

Description

This lecture covers topics such as local and global variables, race conditions, serialization, state machines, multi-threading with 2 loops, and the use of queues in LabVIEW. The instructor demonstrates examples of using local variables to control an LED, employing a switch structure for more complex operations, and the importance of serializing access to shared variables to avoid race conditions.

Instructor

Christophe Salzmann

Expertise Real-time Internet ServicesReal-time controlQuality of Service and Bandwidth adaptationLabVIEW Education PhD | Remote experimentation, Network 2005 – 2005 EPFL Directed by Denis Gillet MS. Degree | Computer Science 1999 – 1999 University of Florida Directed by Prof. H. Latchman Teaching & PhD Past EPFL PhD Students as codirector Damien Perritaz, Evgeny Bogdanov, Wissam Halimi Courses Control systems + TP ME

Official source

Related concepts (32)

Finite-state machine

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.

Turing machine

A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm. The machine operates on an infinite memory tape divided into discrete cells, each of which can hold a single symbol drawn from a finite set of symbols called the alphabet of the machine. It has a "head" that, at any point in the machine's operation, is positioned over one of these cells, and a "state" selected from a finite set of states.

Moore machine

In the theory of computation, a Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. Like other finite state machines, in Moore machines, the input typically influences the next state. Thus the input may indirectly influence subsequent outputs, but not the current or immediate output. The Moore machine is named after Edward F.

Mealy machine

In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. This is in contrast to a Moore machine, whose output values are determined solely by its current state. A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition is possible. The Mealy machine is named after George H. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".

Serialization

In computing, serialization (or serialisation) is the process of translating a data structure or object state into a format that can be stored (e.g. in secondary storage devices, data buffers in primary storage devices) or transmitted (e.g. data streams over computer networks) and reconstructed later (possibly in a different computer environment). When the resulting series of bits is reread according to the serialization format, it can be used to create a semantically identical clone of the original object.

Related lectures (48)

Introducing Advanced Computing Concepts with VPL MOOC: The Thymio robot as a tool for discovering digital science

Explores advanced concepts in programming with Thymio and VPL interface.

LabVIEW Design Patterns

Explores LabVIEW design patterns, covering local and global variables, race conditions, state machines, and producer-consumer architecture.

Distributed Intelligent Systems: Acoustic Field Estimation

Explores acoustic field estimation using wireless sensor networks and discusses challenges in implementing AI techniques in real systems.

LabVIEW: Data Acquisition and Design Patterns

Covers LabVIEW fundamentals, data acquisition, sound acquisition, and design patterns like state machines and producer-consumer.

Digital Systems: Finite State Machines Overview