Transitional Logic
From SarahWiki
Note: Page under construction!
A transitional logic is a multi-value logic that is extended by extra values that directly represent values that change over time. The term was first introduced in a peer-reviewed publication here:
S. Thompson and A. Mycroft, Abstract Interpretation of Combinational Asynchronous Circuits, In Proc. 11th International Symposium on Static Analysis (SAS 2004), R. Giacobazzi, ed., LNCS 3148, Springer Verlag, August, 2004 [Proceedings][Preprint of Extended Journal Version]
though was first used informally (though unpublished) by Sarah Thompson in the early 1990s.
Example
A number of transitional logics are known, and are classified within the SAS'04 paper. The simplest to understand is
, a 5-valued extended logic with the following truth table:
The values are defined as follows:
-
-- True (logic 1) for all time
-
-- False (logic 0) for all time
-
-- False, cleanly becoming True at some (undefined) point in time
-
-- True, cleanly becoming False at some (undefined) point in time
-
-- Any possible signal
Note that
is strictly a superset containing all possible waveforms (i.e. more formally
,
,
and
).

