Sökning: "Timed Deterministic Finite Automata"

Hittade 2 avhandlingar innehållade orden Timed Deterministic Finite Automata.

1. 1. Learning of Timed Systems

   Författare :Olga Grinchtein; Bengt Jonsson; Oded Maler; Uppsala universitet; []
   Nyckelord :learning regular languages; timed systems; event-recording automata;

   Sammanfattning : Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. LÄS MER

3. 2. Optimization of Manufacturing Cells Using Discrete Event Models

   Författare :Avenir Kobetski; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Flexible Manufacturing; Optimal Scheduling; Supervisory Control Theory; A*; Velocity Balancing; Discrete Events Systems; Mixed Integer Linear Programming; Timed Deterministic Finite Automata; Robot Coordination; Visibility Graphs;

   Sammanfattning : As the name suggests, this thesis is concerned with flexible manufacturing systems (FMS) and their way of living. More specifically, the main objective of this workis to generate working schedules for the moving objects of the manufacturing cells. LÄS MER