# Übungszettel 3
Lukas Bruns
Robin Faeseke
Aufgabe 1

digraph G {
    102001 [label="102001=M0"]
    102001 -> 011001 [label=t1]
    011001 -> 101101 [label=t3]
        101101 -> 010101 [label=t1]
    101101 -> 101010 [label=t2]
        010101 -> 100201 [label=t3]
        010101 -> 010010 [label=t2]
    101010 -> 010010[label=t1]
    101010 -> 102001[label=t4]
    102001 -> 100110[label=t2]
    100110 -> 101101[label=t4]
    101101 -> 10110
    
    
    
    
}

Aufgabe 2

digraph G {
    rankdir = LR;
    subgraph place {
        node [shape = circle, fixedsize = true, label ="", height=.3, width=.3, fontsize = 10];
        s1 [label = "••", xlabel = "Lager"];
        s2 [label = "•", xlabel = "s2"];
        s3 [label = "••", xlabel = "s3"];
        s4 [label = "•", xlabel = "Zwischenlager"];
        s5 [label = "•", xlabel = "Zwischenlager"]
        
    }
    
subgraph transitions {
        node [shape=rect,height=0.4,width=.1,fixedsize=true,style=filled,color=black,label="",fontsize=10];
        t1 [xlabel =""]; 
        t2 [xlabel ="t2"];
        t3 [xlabel ="t3"];
        t4 [xlabel ="t4"];
        
        
    }
    
    edge[arrowhead ="vee"];
    
    s1 ->t1;
    t1 -> s2;
    s2 -> t2;
    t2 -> s3;
    s3 -> t3
    t3 -> s4
    t3 -> s5
    s5 -> t4
    s4 -> t4
    t4 -> s1
}