Recent content by XodoX

I have a question about what I would call a relation inside a relation. Like: A={1,2,3) and B={a,b,c} R1={(a,1) ,(a,3), (b,2), (c,1,), (c,3) } R2={(a,a), (b,a), (b,c), (c,a) } R3=R1R2 Like this. I have 2 regular relations. Then I form another relation using these 2. How do I do that? Like...

(( X xor Y ) xor Z ) xor T I hope the truth table is correct. I'm not sure, because of the T. T is always 1, right? X Y Z - (( X xor Y ) xor Z ) xor T 111 - 0 110 - 1 101 - 1 100 - 0 011 - 1 010 - 0 001 -...

I want to use truth tables to show that equations can be satisfied or not, or if they are valid. not(X→(Y→X)) (X∧(notX→notY))→Y I would say the first one is valid, because of the not in front of it, it's always true. I don't know about the second one. I don't know how to split them up best...

Yeah, HML. The least amount of states. Right now it's 4. I have no idea if that's correct and/or if there is more than one solution. But this one above is what I have and it seems logical to me. I'm not 100% sure.

Homework Statement I want to draw an LTS with as few transitions as possible. The basis for this are Hennessy-Milner equationsHomework Equations https://www.dropbox.com/s/ym3ygjdnhldz09r/HML%20Equations.jpg Those are the equations and how p1 is defined. The Attempt at a Solution...

Thank you! Didn't think of proof by induction.

When you have a graph like this one here: https://www.dropbox.com/s/tchpodpt2gp1huf/Bisimulation.jpg Of course you find bisimilar points/paths. There must be two points or path that have the "greatest" bisimilarity of all. Is this not correct ? And if you have that kind of bisimilarity, how...

Makes sense. Does this prove it, though ? I mean, is there any calculation to prove this, or you just basically say that's how it is.

I'm not sure if I am using the right terms here, but: When X is a finite set and R is a relation... If (X,R) is a lattice, then (X,R) is also a complete lattice. Does this make sense? The question then is, why is is also automatically complete. I don't understand that.

Homework Statement https://www.dropbox.com/s/p09aulbcf02pfhk/Bisimilarity.jpg Find out if q1-p3 and p3->q1 are "strongly bi-similar" Homework Equations The Attempt at a Solution No idea. I have to consider the transition of p and then show it's properly matched by some transition of q ...

Yes, I know, but I don't what you're referring to. So the empty set mean nothing in common. I have A and B, so the max is A+B. Like having two separate balls. But the A or B... if they are disjoint, it says it's 0. That would mean A and B have also a min that is 0, but there's only a max...

I don't understand it. A has n elements, and B has m elements. Give the exact maximum/minimum of 1) A \bigcup B 2) A \bigcap B 3) A X BI don't understand the solution to this.. 1) If A and B are a disjunction ( A\bigcap B = ∅), then the max of A \bigcup B is: A \bigcap B = ∅ ->...

How to prove "Satisfiability of boolean formulas is NP-complete" I can not figure out how to prove this. I have been trying to find something that explains it step by step, possibly even with an example. I can not find anything. Can somebody perhaps explain how you prove it or show me where I...

Not really.

I already saw that.