Pith. sign in

REVIEW

Reconstruct the Logical Network from the Transition Matrix

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.09681 v1 pith:VVUNV4Z4 submitted 2017-10-25 cs.SY cs.SYmath.OC

classification cs.SYmath.OC
keywords logicalmatrixnetworktransitionalgebraicexpressionmethodreconstructing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Reconstructing the logical network from the transition matrix is benefit for learning the logical meaning of the algebraic result from the algebraic representation of a BN. And so far there has no method to convert the matrix expression back to the logic expression for a BN with an arbitrary topology structure. Based on the canonical form and Karnaugh map, we propose a method for reconstructing the logical network from the transition matrix of a Boolean network in this paper.

Discussion (0). Sign in to comment.

Pith tools