State diagram

A state diagram is a type of diagram used in computer science and related fields to describe the behavior of systems. State diagrams require that the system described is composed of a finite number of states; sometimes, this is indeed the case, while at other times this is a reasonable abstraction. Many forms of state diagrams exist, which differ slightly and have different semantics. Overview State diagrams are used to give an abstract description of the behavior of a system. This behavior is analyzed and represented by a series of events that can occur in one or more possible states. Hereby "each diagram usually represents objects of a single class and track the different states of its objects through the system". State diagrams can be used to graphically represent finite-state machines (also called finite automata). This was introduced by Claude Shannon and Warren Weaver in their 1949 book The Mathematical Theory of Communication. Another source is Taylor Booth in his

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Related people

Related units

Related concepts

Related courses

Related lectures

Summary

Official source

About this result

Related publications (18)

Related publications

Related people (43)

Related people

Related units (6)

Related units

Related concepts (9)

Related concepts

Related courses (11)

Related courses

Related lectures (24)

Related lectures

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 ca

Unified Modeling Language

The unified modeling language (UML) is a general-purpose visual modeling language that is intended to provide a standard way to visualize the design of a system. UML provides a stan

Automata theory

Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word automata

BPMN process generation and optimization for readability in the context of telemedecine

Charline Montial

In business, automated processes can be specified using the BPMN standard, which stands for Business Process Model and Notation. It is presented as flowcharts with standardized graphical elements to show the possible flows and activities of a process. These diagrams can be seen as a graph with logical expressions conditioning their edges. The telemedecine start-up Soignez-moi.ch uses BPMN to describe complex medical forms in a readable way. Soignez-moi.ch offers medical consultations via an online platform. The first step for the patient is to fill a questionnaire about his/her symptoms. In the second step, a doctor accesses to the answers and proceeds to call the patient for the teleconsultation. The complexity of these medical forms comes from the fact that the questions are adapted to the patient answers, which leads to different possible flows. Complex forms from another telemedecine website, Diaana, had to be translated to BPMN to be compatible and used at Soignez-moi.ch. Diaana is a contraction of the words diagnosis and anamnesis. The way these forms are specified is very different from what has been modeled in Soignez-moi.ch: instead of having separated branches, there is a sequential list of questions. In this list, every question is evaluated on its own to see if it is asked or not. The question conditions are Boolean expressions. If a direct translation to BPMN is performed, there is no branching to show the relationships between the questions. The aim of my work is to highlight similarities in the branch conditions to make the diagrams more readable and editable by humans. Doctors and collaborators read the medical BPMN processes and may modify them. It should be a pleasant experience for them to go through the diagrams. They should quickly understand in a visual way if questions are related, and how they are related. The BPMN process readability has been achieved by extracting patterns, showing the implications between the questions to have a readable diagram with meaningful branches. This translation has been applied to 18 questionnaires. Two questionnaires were not improved because they were only composed of one question. One questionnaire was also not improved because all its questions were unconditional, meaning that no relationship between the question conditions could be highlighted. Another questionnaire with conditional questions was not improved because its conditions were unrelated. 14/18 questionnaires have had their readability improved.

2022

Search for heavy neutral leptons in W plus . mu plus mu +/- jet decays

Liupan An, Guido Andreassi, Vladislav Balagura, Aurelio Bay, Violaine Bellée, Federico Betti, Marc-Olivier Bettler, Frédéric Blanc, Maxim Borisyak, Chunhui Chen, Peter Clarke, Victor Coco, Tommaso Colombo, Greig Alan Cowan, Adam Davis, Michel De Cian, Hans Dijkstra, Mirco Dorigo, Paolo Durante, Dipanwita Dutta, François Fleuret, Christoph Frei, Olivier Göran Girard, Elena Graverini, Guido Haefeli, Xiaoxue Han, Plamen Hristov Hopchev, Thibaud Humair, Chitsanu Khurewathanakul, Veronica Sølund Kirsebom, Axel Kuonen, Yiming Li, Vladimir Macko, Pietro Marino, Maurizio Martinelli, Tatsuya Nakada, Tara Nanut, Matthew Needham, Niko Neufeld, Preema Rennee Pais, Luca Pescatore, Anton Petrov, Guillaume Max Pietrzyk, Jessica Prisciandaro, Renato Quagliani, Gerhard Raven, Federico Leo Redi, Olivier Schneider, Maxime Schubiger, Sebastian Schulte, Evgenii Shmanin, Pavol Stefko, Maria Elena Stramaglia, Liang Sun, Zhipeng Tang, Frédéric Teubert, Mark Tobin, Minh Tâm Tran, Maria Vieites Diaz, Mingkui Wang, Jian Wang, Zheng Wang, Yi Wang, Zhirui Xu, Hang Yin, Lei Zhang, Yi Zhang, Yu Zheng

A search is performed for heavy neutrinos in the decay of a W boson into two muons and a jet. The data set corresponds to an integrated luminosity of approximately 3.0 fb-1 of proton-proton collision data at centre-of-mass energies of 7 and 8 TeV collected with the LHCb experiment. Both same-sign and opposite-signmuons in the final state are considered. Data are found to be consistent with the expected background. Upper limits on the coupling of a heavy neutrino with the Standard Model neutrino are set at 95% confidence level in the heavy-neutrino mass range from 5 to 50GeV/c2. These are of the order of 10(-3) for lepton-number-conserving decays and of the order of 10(-4) for lepton-number-violating heavy-neutrino decays.

SPRINGER2021

Observation of the Lambda(0)(b) -> chi(c1) (3872)pK(-) decay

Using proton-proton collision data, collected with the LHCb detector and corresponding to 1.0, 2.0 and 1.9 fb(-1) of integrated luminosity at the centre-of-mass energies of 7, 8, and 13 TeV, respectively, the decay Lambda(0)(b) -> chi(c1)(3872)pK(-) with chi(c1)(3872) -> J/psi pi(+)pi(-) is observed for the first time. The significance of the observed signal is in excess of seven standard deviations. It is found that (58 +/- 15)% of the decays proceed via the two-body intermediate state chi(c1)(3872)Lambda(1520). The branching fraction with respect to that of the Lambda(0)(b) -> psi(2S)pK(-) decay mode, where the psi(2S) meson is reconstructed in the J/psi pi(+)pi(-) final state, is measured to be: B(Lambda(0)(b) -> chi(c1)(3872)pK(-))/B (Lambda(0)(b) -> psi(2S)pK(-)) x B(chi(c1)(3872) -> J/psi pi(+)pi(-))/B(psi(2S) -> J/psi pi(+)pi(-)) = (5.4 +/- 1.1 +/- 0.2) x 10(-2), where the first uncertainty is statistical and the second is systematic.

Springer2019

EE-110: Logic systems (for MT)

Ce cours couvre les fondements des systèmes numériques. Sur la base d'algèbre Booléenne et de circuitscombinatoires et séquentiels incluant les machines d'états finis, les methodes d'analyse et de synthèse de systèmelogiques sont étudiées et appliquée

EE-334: Digital systems design

Students will acquire basic knowledge about methodologies and tools for the design, optimization, and verification of custom digital systems/hardware. They learn how to design synchronous digital circuits on register transfer level, analyse their timing and implement them in VHDL and on FPGAs.

MGT-484: Applied probability & stochastic processes

This course focuses on dynamic models of random phenomena, and in particular, the most popular classes of such models: Markov chains and Markov decision processes. We will also study applications in queuing theory, finance, project management, etc.