<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.dialogicdesignscience.info/w/index.php?action=history&amp;feed=atom&amp;title=Characteristic_Logic_Equations</id>
	<title>Characteristic Logic Equations - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.dialogicdesignscience.info/w/index.php?action=history&amp;feed=atom&amp;title=Characteristic_Logic_Equations"/>
	<link rel="alternate" type="text/html" href="https://www.dialogicdesignscience.info/w/index.php?title=Characteristic_Logic_Equations&amp;action=history"/>
	<updated>2026-04-15T03:35:56Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.6</generator>
	<entry>
		<id>https://www.dialogicdesignscience.info/w/index.php?title=Characteristic_Logic_Equations&amp;diff=409&amp;oldid=prev</id>
		<title>Laouris: Created page with &quot;DERIVATION OF THB CHARACfl!RISTIC Loo,c EQUATION The characteristic logic equation expresses the necessary and sufficient conditions to be satisfied by the entries in an inter...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.dialogicdesignscience.info/w/index.php?title=Characteristic_Logic_Equations&amp;diff=409&amp;oldid=prev"/>
		<updated>2022-01-09T10:15:47Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;DERIVATION OF THB CHARACfl!RISTIC Loo,c EQUATION The characteristic logic equation expresses the necessary and sufficient conditions to be satisfied by the entries in an inter...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;DERIVATION OF THB CHARACfl!RISTIC Loo,c EQUATION&lt;br /&gt;
The characteristic logic equation expresses the necessary&lt;br /&gt;
and sufficient conditions to be satisfied by the entries in an&lt;br /&gt;
interconnection matrix M8,. that interconnects two hierarchical&lt;br /&gt;
digraphs A* and B* for which M,18 = 0.&lt;br /&gt;
Digraphs A* and B* are described by the reachability&lt;br /&gt;
matrices M,1,1a nd M88, respectively. Each of these matrices&lt;br /&gt;
can be assumed to have the following properties.&lt;br /&gt;
a) The indices of the matrix are ordered in blocks&lt;br /&gt;
corresponding to levels in the hierarchical relation, beginning&lt;br /&gt;
with the highest level and ending with the lowest.&lt;br /&gt;
b) As a consequence of a), every entry to the right of the&lt;br /&gt;
main diagonal is 0.&lt;br /&gt;
c) By definition, the main diagonal is filled with I&amp;#039;s.&lt;br /&gt;
d) By definition, the Boolean square of the matrix is&lt;br /&gt;
identical to the matrix.&lt;br /&gt;
e) Because of d), the matrix is its own transitive&lt;br /&gt;
closure [I].&lt;br /&gt;
Reachability for the digraph c• that results from the&lt;br /&gt;
interconnection is described by the reachability matrix M cc,&lt;br /&gt;
which can be assumed to have the following properties.&lt;br /&gt;
I) Mee can be written in the form&lt;/div&gt;</summary>
		<author><name>Laouris</name></author>
	</entry>
</feed>