Sökning: "automata"

Visar resultat 1 - 5 av 75 uppsatser innehållade ordet automata.

  1. 1. SeqLTL and ωLTL

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Oskar Grekula; [2023-10-19]
    Nyckelord :Linear Temporal Logic; Co-safety LTL; Tight Witness; Compositional;

    Sammanfattning : Linear Temporal Logic (LTL) is worthwhile for its applications in, among others, model checking, runtime verification and reactive synthesis. However, many useful properties are not expressible in LTL, or not in a natural way. LÄS MER

  3. 2. Simulated molecular adder circuits on a surface of DNA : Studying the scalability of surface chemical reaction network digital logic circuits

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Jakob Arvidsson; [2023]
    Nyckelord :Surface chemical reaction networks; Molecular computing; DNA computing; Circuit simulation; Adders; Ytbundna kemiska reaktionsnätverk; Molekylär beräkning; DNA-beräkning; Kretssimulering; Additionskretsar;

    Sammanfattning : The behavior of the Deoxyribonucleic Acid (DNA) molecule can be exploited to perform useful computation. It can also be ”programmed” using the language of Chemical Reaction Networks (CRNs). One specialized CRN construct is the Surface Chemical Reaction Network (SCRN). LÄS MER

  4. 3. Probabilistic guarantees in model-checking with Time Petri Nets

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Manon Lecart; [2023]
    Nyckelord :Formal Methods; Statistical Model-Checking; Timed Automata; Timed PetriNets; Formella Metoder; Statistisk Modellkontroll; Timed Automater; Time Petri Nets;

    Sammanfattning : With the prevalence of technology and computer systems in today’s society, it is crucial to ensure that the systems we use are secure. The fields that study these issues, cybersecurity and cybersafety, use the formal verification technique of modelchecking. LÄS MER

  5. 4. Advancements in Dependability Analysis of Safety-Critical Systems : Addressing Specification Formulation and Verification Challenges

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Zelin Yu; [2023]
    Nyckelord :Specification theory; Contracts; Automata theory; Refinement; Specifikationsteori; Kontrakt; Automatteori; Förfina;

    Sammanfattning : Safety-critical systems have garnered increasing attention, particularly regarding their dependability analysis. In modern times, these systems comprise numerous components, making it crucial to verify that lower-level components adhere to their specifications will ensure the overall system’s compliance with its top-level specification. LÄS MER

  7. 5. 3D Texture Synthesis Using Graph Neural Cellular Automata

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Yitao Xu; [2023]
    Nyckelord :3D Texture Synthesis; Graph Neural Cellular Automata; Image-guided Synthesis; Text-guided Manipulation; Canvas Lärplattform; Dockerbehållare; Prestandajustering 3D-textursyntes; Graf Neurala Cellulära Automater; Bildledd Syntes; Textledd Manipulation;

    Sammanfattning : In recent years, texture synthesis has been a heated topic in computer graphics, and the development of advanced algorithms for generating high-quality 3D textures is an area of active research. A recently proposed model, Neural Cellular Automata, can synthesize realistic 2D texture images or videos. LÄS MER