2
$\begingroup$

I am having trouble mathematically representing boolean logic gates that have logical hysteresis as they have "state". In asynchronous circuits for example, I have something similar to a AND gate called a Muller C-element that is very much like a logical AND, but the logic is different depending on the initial condition. Starting from 0,0, the truth table is identical to the AND:

A | B | S
0 | 0 | 0
0 | 1 | 0
1 | 0 | 0
1 | 1 | 1

This results in the boolean equation $S = A \land B$; however, starting from 1,1, the truth table is:

A | B | S
0 | 0 | 0
0 | 1 | 1
1 | 0 | 1
1 | 1 | 1

The fundamental issue that I am having is that this logic gate has "state". Even if I describe the gate using pure boolean logic (I can build a static c-element with 3x ANDs and a 3-input OR), I still have the issue of state when describing the function.

Is there an method in boolean mathematics to define pure boolean logic that has state dependence?

  • 0
    The natural approach would be to describe the pair of output and new state as a function as input and old state. – 2017-02-04
  • 0
    @HenningMakholm I was considering that, but I am trying to get something general form because what I actually want to describe is very large. Due to the interesting control structures that can be made with devices like this, I was hoping that someone knew of a standard method. I'm sorry to say that boolean logic is something that I know from the practical, but not theoretical aspect. – 2017-02-04
  • 0
    Hmm, "pair of output and new state as a function as input and old state" sounds pretty general to me. – 2017-02-04
  • 0
    If you want it to be even more general you would talk of representing the output as a function of the entire history of all of the inputs ... but then you would have a hard time figuring out whether a given such representation specifies something that has a practical realization. – 2017-02-04
  • 0
    @HenningMakholm My fundamental issue is that the actual thing I want to describe is very large. I will let this question sit here for a few days, and hopefully someone has looked at an esoteric boolean math problem like this. If not, I encourage you to turn your first comment into an answer as that does seem most promising. – 2017-02-04
  • 0
    Just because something is large does not mean the approach by Henning is wrong. You essentially need a latch for each old state. So A and Aold. – 2017-02-05
  • 0
    @HenningMakholm write up your suggested method and I'll accept it. I've been unable to come up with a better way than your suggestion (\$2^{40}\$v states! if anyone ever needs a specific one, a computer can just brute force its way there.) – 2017-02-06

0 Answers 0